Loading...
Please wait, while we are loading the content...
Logic Based Modeling and Analysis of Workflows (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Davulcu, Hasam Kifer, Michael Ramakrishnan, C. R. Ramakrishnan, I. V. |
| Description | We propose Concurrent Transaction Logic (CT R) as the language for specifying, analyzing, and scheduling of workflows. We show that both local and global properties of workflows can be naturally represented as CT R formulas and reasoning can be done with the use of the proof theory and the semantics of this logic. We describe a transformation that leads to an efficient algorithm for scheduling workflows in the presence of global temporal constraints, which leads to decision procedures for dealing with several safety related properties such as whether every valid execution of the workflow satisfies a particular property or whether a workflow execution is consistent with some given global constraints on the ordering of events in a workflow. We also... |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 1998-01-01 |
| Publisher Institution | In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems |
| Access Restriction | Open |
| Subject Keyword | Decision Procedure Global Property Valid Execution Efficient Algorithm Global Constraint Particular Property Workflow Execution Concurrent Transaction Logic Ct Formula Workflow Satisfies Global Temporal Constraint Several Safety Proof Theory |
| Content Type | Text |
| Resource Type | Article |
