Notions of computation and monads
Information and Computation
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Information system behavior specification by high level Petri nets
ACM Transactions on Information Systems (TOIS)
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
A top-down Petri net-based approach for dynamic workflow modeling
BPM'03 Proceedings of the 2003 international conference on Business process management
DFL: A dataflow language based on Petri nets and nested relational calculus
Information Systems
Modeling and optimization of scientific workflows
Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
Efficient provenance storage over nested data collections
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Exploring Scientific Workflow Provenance Using Hybrid Queries over Nested Data and Lineage Graphs
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II
Fundamenta Informaticae
Scientific workflow design with data assembly lines
Proceedings of the 4th Workshop on Workflows in Support of Large-Scale Science
Proceedings of the 1st International Workshop on Workflow Approaches to New Data-centric Science
Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II
Fundamenta Informaticae
Hi-index | 0.00 |
In this paper we propose a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of Petri nets, which are responsible for the organization of the processing tasks, and Nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system. We demonstrate that dataflows constructed in hierarchical manner, according to a set of refinement rules we propose, are sound: initiated with a single token (which may represent a complex scientific data collection) in the input node, terminate with a single token in the output node (which represents the output data collection). In particular they always process all of the input data, leave no ”debris data” behind and the output is always eventually computed.