Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
UML for real
PASSing the provenance challenge
Concurrency and Computation: Practice & Experience - The First Provenance Challenge
Querying and re-using workflows with VsTrails
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Workflows and e-Science: An overview of workflow system features and capabilities
Future Generation Computer Systems
Fine-grained and efficient lineage querying of collection-based workflow provenance
Proceedings of the 13th International Conference on Extending Database Technology
Prospective and Retrospective Provenance Collection in Scientific Workflow Environments
SCC '10 Proceedings of the 2010 IEEE International Conference on Services Computing
The Open Provenance Model core specification (v1.1)
Future Generation Computer Systems
Occurrence nets then and now: the path to structured occurrence nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
A new approach for publishing workflows: abstractions, standards, and linked data
Proceedings of the 6th workshop on Workflows in support of large-scale science
Provenance collection support in the kepler scientific workflow system
IPAW'06 Proceedings of the 2006 international conference on Provenance and Annotation of Data
Causality in structured occurrence nets
Dependable and Historic Computing
ProvManager: a provenance management system for scientific workflows
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Occurrence Nets (ON) are directed acyclic graphs that represent causality and concurrency information concerning a single execution of a system. Structured Occurrence Nets (SONs) extend ONs by adding new relationships, which provide a means of recording the activities of multiple interacting, and evolving, systems. Although the initial motivations for their development focused on the analysis of system failures, their structure makes them a natural candidate as a model for expressing the execution traces of interacting systems. These traces can then be exhibited as the provenance of the data produced by the systems under observation. In this paper we present a number of patterns that make use of SONs to provide principled modelling of provenance. We discuss some of the benefits of this modelling approach, and briefly compare it with others that have been proposed recently. SON-based modelling of provenance combines simplicity with expressiveness, leading to provenance graphs that capture multiple levels of abstraction in the description of a process execution, are easy to understand and can be analysed using the partial order techniques underpinning their behavioural semantics.