The relational model with relation-valued attributes
Information Systems
An Alternative Way to Analyze Workflow Graphs
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Specifying access control policies for XML documents with XPath
Proceedings of the ninth ACM symposium on Access control models and technologies
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When are two workflows the same?
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Peer-to-peer form based web information systems
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Journal of Management Information Systems
A model, schema, and interface for metadata file systems
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
On the relationship between workflow models and document types
Information Systems
On Detecting Data Flow Errors in Workflows
Journal of Data and Information Quality (JDIQ)
| Hi-index | 0.00 |
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.