Analyzing workflows implied by instance-dependent access rules
Paper
Paper/Presentation Title | Analyzing workflows implied by instance-dependent access rules |
---|---|
Presentation Type | Paper |
Authors | Calders, Toon (Author), Dekeyser, Stijn (Author), Hidders, Jan (Author) and Paredaens, Jan (Author) |
Number of Pages | 10 |
Year | 2006 |
Place of Publication | United States |
Digital Object Identifier (DOI) | https://doi.org/10.1145/1142351.1142365 |
Web Address (URL) of Paper | https://dl.acm.org/doi/10.1145/1142351.1142365 |
Web Address (URL) of Conference Proceedings | https://dl.acm.org/doi/proceedings/10.1145/1142351 |
Conference/Event | 2006 ACM SIGMOD/PODS Conference |
Event Details | 2006 ACM SIGMOD/PODS Conference Event Date 26 to end of 29 Jun 2006 Event Location Chicago, United States of America |
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. |
Keywords | instance-dependent access rules, workflows |
Contains Sensitive Content | Does not contain sensitive content |
ANZSRC Field of Research 2020 | 461399. Theory of computation not elsewhere classified |
490103. Calculus of variations, mathematical aspects of systems theory and control theory | |
Public Notes | File reproduced in accordance with the copyright policy of the publisher/author. |
Byline Affiliations | University of Antwerp, Belgium |
Department of Mathematics and Computing |
https://research.usq.edu.au/item/9x9yz/analyzing-workflows-implied-by-instance-dependent-access-rules
Download files
2705
total views618
total downloads1
views this month2
downloads this month