Executable workflows: a paradigm for collaborative design on the Internet
DAC '97 Proceedings of the 34th annual Design Automation Conference
Logic based modeling and analysis of workflows
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computing Rules for Detecting Contradictory Transaction Termination Dependencies
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Formalizing Workflows Using the Event Calculus
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
CTR-S: a logic for specifying contracts in semantic web services
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
An architecture for workflow scheduling under resource allocation constraints
Information Systems
Automatic workflow verification and generation
Theoretical Computer Science
A logical framework for scheduling workflows under resource allocation constraints
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reasoning about the behavior of Semantic Web services with concurrent transaction logic
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Process-oriented organisation modelling and analysis
Enterprise Information Systems - Contains Special Issue: Modelling, Simulation, Verification and Validation of Enterprise Information Systems, edited by Juan Carlos Augusto and Marc Roper
| Hi-index | 0.00 |
Workflows are the semantically appropriate composite activities in heterogeneous computing environments. Such environments typically comprise a great diversity of locally autonomous databases, applications, and interfaces. Much good research has focused on the semantics of workflows, and how to capture them in different extended transaction models. Here we address the complementary issues pertaining to how workflows may be declaratively specified, and how distributed constraints may be derived from those specifications to enable local control, thus obviating a centralized scheduler. Previous approaches to this problem were limited and often lacked a formal semantics.