ACM Home Page
Please provide us with feedback. Feedback
Analyzing workflows implied by instance-dependent access rules
Full text PdfPdf (429 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Chicago, IL, USA
SESSION: Analysis of queries and workflows table of contents
Pages: 100 - 109  
Year of Publication: 2006
ISBN:1-59593-318-2
Authors
Toon Calders  University of Antwerp, Belgium
Stijn Dekeyser  University of Southern Queensland, Australia
Jan Hidders  University of Antwerp, Belgium
Jan Paredaens  University of Antwerp, Belgium
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 35,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142351.1142365
What is a DOI?

ABSTRACT

Recently proposed form-based web information systems liberate the capture and reuse of data in organizations by substituting the development of technical implementations of electronic forms for the conceptual modelling of forms' tree-structured schemas and their data access rules. Significantly, these instance-dependent rules also imply a workflow process associated to a form, eliminating the need for a costly workflow design phase. Instead, the workflows thus created in an ad hoc manner by unsophisticated end-users can be automatically analyzed, and incorrect forms rejected.This paper examines fundamental correctness properties of workflows that are implied by instance-dependent access rules. Specifically, we study the decidability of the form completability property and the semi-soundness of a form's workflow. These problems are affected by a choice of constraints on the path language used to express access rules and completion formulas, and on the depth of the form's schema tree. Hence, we study these problems by examining them in the context of several different fragments determined by such constraints.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Microsoft Office InfoPath, 2003, http://www.microsoft.com/office/infopath/prodinfo/default.mspx.
 
2
J. Boyer, D. Landwehr, R. Merrick, T. Raman, M. Dubinko, and L. Klotz, XForms 1.0 (second edition), W3C Recommendation, March 2006, http://www.w3.org/MarkUp/Forms/.
3
 
4
S. Dekeyser, J. Hidders, R. Watson, and R. Addie, Peer-to-peer form based web information systems, ADC 2006 (Hobart, Tasmania, Australia) (Gill Dobbie and James Bailey, eds.), Australian Computer Society, Inc., January 2006.
5
 
6
 
7
Hajo A. Reijers, Selma Limam, and Wil M. P. van der Aalst, Product-based workflow design, Journal of Management Information Systems 20 (2003), no. 1, 229--262.
 
8
 
9
W. van der Aalst, The application of petri nets to workflow management, Journal of Circuits, Systems, and Computers 8 (1998), no. 1, 21--66.
 
10


Collaborative Colleagues:
Toon Calders: colleagues
Stijn Dekeyser: colleagues
Jan Hidders: colleagues
Jan Paredaens: colleagues