Edinburgh Research Explorer

Composition and substitution in provenance and workflows

Research output: Contribution to conferencePaper

Original languageEnglish
Publication statusPublished - 8 Jun 2016
Event8th USENIX Workshop on the Theory and Practice of Provenance - Washington D.C, United States
Duration: 8 Jun 20169 Jun 2016
https://www.usenix.org/conference/tapp16

Conference

Conference8th USENIX Workshop on the Theory and Practice of Provenance
Abbreviated titleTaPP 2016
CountryUnited States
CityWashington D.C
Period8/06/169/06/16
Internet address

Abstract

It is generally accepted that any comprehensive provenance model must allow one to describe provenance at various levels of granularity. For example, if we have a provenance graph of a process which has nodes to describe subprocesses, we need a method of expanding these nodes to obtain a more detailed provenance graph. To date, most of the work that has attempted to formalize this notion has adopted a descriptive approach to this issue: for example, given two provenance graphs under what conditions is one “finer grained” than another. In this paper we take an operational approach. For example, given two provenance graphs of interacting processes, what does it mean to compose those graphs? Also, given a provenance graph of a process and a provenance graph of one of its subprocesses, what is the operation of substitution that allows us to expand the graph into a finer-grained graph? As well as provenance graphs, these questions also apply to workflow graphs and other process models that occur in computer science. We propose a model and operations that addresses these problems. While it is only one of a number of possible solutions, it does indicate that a basic adjustment to
provenance models is needed if they are properly to accommodate such an operational approach to composition and substitution.

Event

8th USENIX Workshop on the Theory and Practice of Provenance

8/06/169/06/16

Washington D.C, United States

Event: Conference

ID: 35255352