Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communicating sequential processes
An overview of transaction logic
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Information system behavior specification by high level Petri nets
ACM Transactions on Information Systems (TOIS)
Distributed and Parallel Databases
Kepler: An Extensible System for Design and Execution of Scientific Workflows
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
IBM Systems Journal
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
YAWL: yet another workflow language
Information Systems
An approach to optimize data processing in business processes
VLDB '07 Proceedings of the 33rd 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
DFL: A dataflow language based on Petri nets and nested relational calculus
Information Systems
Markup and Component Interoperability for Active Rules
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Active rules in the semantic web: dealing with language heterogeneity
RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web
Hi-index | 0.00 |
In this paper we combine ideas from workflow processing and database query answering. Tailoring process algebras like Milner's Calculus of Communicating Systems (CCS) to relational dataflow makes them a natural candidate for specifying data-oriented workflows in a declarative way. In addition to the classical evaluation of relational operator trees, the combination with the CCS control structures provides (guarded) alternatives and test-based iterations using recursive process fragment definitions. For the actual atomic constituents of the process, language concepts from the relational world, like queries, but also the use of abstract datatypes, e.g., graphs, can be embedded. We illustrate the advantages of the approach by an application scenario with remote, heterogeneous sources and Web Services that return their results asynchronously. The presented approach has been implemented in a prototype.