<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Augmenting PROV with Plans in P-PLAN: Scientific Processes as Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Daniel Garijo</string-name>
          <email>dgarijo@delicias.dia</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>OEG-DIA, Facultad de Informática, Universidad Politécnica de Madrid</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Yolanda Gil Information Sciences Institute and Department of Computer Science, University of Southern California</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Provenance models are crucial for describing experimental results in science. The W3C Provenance Working Group has recently released the PROV family of specifications for provenance on the Web. While provenance focuses on what is executed, it is important in science to publish the general methods that describe scientific processes at a more abstract and general level. In this paper, we propose P-PLAN, an extension of PROV to represent plans that guided the execution and their correspondence to provenance records that describe the execution itself. We motivate and discuss the use of P-PLAN and PROV to publish scientific workflows as Linked Data.</p>
      </abstract>
      <kwd-group>
        <kwd>provenance</kwd>
        <kwd>plan</kwd>
        <kwd>PROV</kwd>
        <kwd>scientific workflows</kwd>
        <kwd>Linked Data</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        A crucial element of Linked Data for science is the publication and sharing of
scientific processes to document how scientific results are generated. There are many kinds
of scientific processes that could be shared as Linked Data. Recent research in this
area includes publishing scientific workflows that capture data analysis processes [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
documenting scientific experiments, structuring claims and conclusions in scientific
publications (as in SWAN1), and more recently organizing Research Objects [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. For
all these efforts, it is important to publish how scientific processes were executed, but
it is also important to publish how they were planned. For example, assays are used to
describe an experimental procedure in a biology laboratory and are very precise,
while protocols are more general descriptions of those procedures. In essence, these
protocols represent the plans that are followed in carrying out the assays.
      </p>
      <p>There is now an emerging standard for publishing the provenance of processes on
the Web. This standard could be used for the publication of scientific processes,
improving interoperability across scientific software as well as interoperability with
other web provenance. The W3C PROV model2 describes the provenance of objects
(prov:Entities) as a record of assertions about the steps (prov:Activities) that
generated them and the entities used in those steps. Provenance describes past execution, but
does not offer a vocabulary to express the plan that the execution was supposed to
follow. In terms of our example above, provenance vocabularies are appropriate for
describing assays once they are executed, but are not designed to describe protocols.</p>
      <p>Therefore, in addition to the provenance record, it is often desirable to publish the
plan that was followed during the execution. This would allow the provenance record
to include what was envisioned would happen prior to the execution. Publishing the
plan has several benefits: 1) the plan can provide a higher-level, more abstract
description of what was executed, which improves understandability and facilitates
reuse in future situations; 2) the plan can describe the expectations for the execution,
which can then be contrasted with the provenance to detect deviations and correct
abnormalities. Acknowledging this need, PROV includes the term “prov:Plan”.
However, it does not elaborate any further how plans can be described or related to other
provenance elements of the execution.</p>
      <p>Several vocabularies have been proposed to represent different aspects of scientific
processes, including SWAN and OBI3. Ideally, the PROV standard would be adopted
for all provenance aspects of these vocabularies, enabling interoperability of their
records. However PROV will not address aspects concerned with methods and
abstract plans, which would be useful for interoperability of linked science data.</p>
      <p>
        In this paper we propose to address this necessity by extending PROV with
PPLAN, a vocabulary for describing abstract scientific workflows as plans. This
proposal builds on our previous work on OPMW4 where we published scientific
workflows compliant with OPM as Linked Data [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Representing Plans and their executions</title>
      <p>
        Developing a vocabulary for plans is a daunting task. Plan representations vary
widely in formalism and complexity, from simple graph-based plan representations to
dynamic logics with quantification and temporal reasoning. Some plan
representations encompass meta-planning (e.g., to decide what goals to take on), scheduling (to
allocate resources to steps), interoperability (with special focus on reuse5) and failure
handling. The DOLCE [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] ontology includes a representation of plans that is a superb
synthesis of this representational diversity.
      </p>
      <p>In order to expose the relation between the plan and the execution, we wanted to
have plans aligned closely with provenance records. Because provenance assertions in
PROV can be seen as a direct acyclic graph of steps and entities used and generated
by them, we set out to develop a simple plan vocabulary for plans that can be
represented also as a directed acyclic graph of steps and relevant entity descriptions. This is
2 http://www.w3.org/TR/prov-dm/
3 http://obi-ontology.org/
4 http://www.opmw.org
5 http://www.shiwa-workflow.eu/web/guest
a limitation of our approach, but we believe that this model can capture a significant
amount of workflows (which are often described as simple pipelines) and other types
of processes. The initial model that we propose here could be extended later on with
more complex plan (and workflow) constructs.
2.1</p>
      <sec id="sec-2-1">
        <title>Plan execution as PROV</title>
        <p>PROV describes the usage and generation of entities through two main properties:
prov:wasGeneratedBy (an Entity wasGeneratedBy an Activity) and prov:used (an
Activity used an Entity for the execution). The agents responsible for the execution
are linked to the activity as prov:Agent with the property prov:wasAssociatedWith.
All properties can be qualified with prov:Roles. Provenance assertions can be grouped
in prov:Bundles, so that provenance can be asserted for the bundle.</p>
        <p>In PROV plans are defined as entities associated with an agent and an activity.
PROV does not specify anything further about plans and how they correspond to parts
of the execution, as it is considered out of the scope of the model for provenance.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Extending PROV to represent plans</title>
        <p>may not have a corresponding activity, (as in an execution failure). p-plan:Variables
represent the inputs of the steps and can have properties (i.e., type, restrictions,
metadata, etc.). p-plan:Steps have p-plan:Variables as input and p-plan:Variables are
output of p-plan:Steps. Both of them are associated to a p-plan: Plan. The relation of
the plan with agents is not specified P-PLAN, since it can be modeled with PROV.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Publishing scientific workflows</title>
      <p>Plans can be used to represent abstract workflows that describe reusable templates of
computations. p-plan:Step can be used to describe workflow steps, and
pplan:Variable can be used to represent input and output datasets of the step as well as
parameters of the computation. PROV can be used to represent the execution,
including each step as a prov:Activity and each dataset as a prov:Entity.</p>
      <p>PROV also allows defining chains of responsibility for agents. This is very useful
when publishing a workflow execution, since the user triggering the submission
delegates to the workflow system(s) and in turn to the execution engine.</p>
      <p>An example of what this modeling would enable is linking across different
executions of workflow templates from different platforms and different domains published
as Linked Data. For example, the query below would return all abstract workflows
(plans) in which a given entity (?entity) has been used when executing them. This
helps to understand the usage of a dataset across workflow executions and how
different workflow templates relate to each other.</p>
      <p>SELECT DISTINCT ?plan WHERE {
?entity a p-plan:Entity,prov:Entity;</p>
      <p>p-plan:correspondsTo ?templVariable.
?templVariable a p-plan:Variable;</p>
      <p>p-plan:isVariableOfPlan ?plan.}
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>We propose P-PLAN as a vocabulary for publishing plans and linking executions to
them as a proposed extension to the PROV standard. P-PLAN is generic and could be
extended to represent more complex plans, (e.g., plans with hierarchical
decompositions). We consider it a necessary step in scientific workflow publication as Linked
Data, and crucial to understand the method performed in an experiment.</p>
      <p>We are currently exporting the provenance of workflow templates and executions
with both OPMW and PROV, with a mapping to P-PLAN. In future work, we plan to
map P-PLAN to broadly used ontologies like DOLCE and other vocabularies that
describe scientific processes, such as SWAN and OBI.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bechhofer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buchan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Roure</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Missier</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ainsworth</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhagat</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Couch</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cruickshank</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Delder_eld,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Dunlop</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Gamble</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Michaelides</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Owen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Newman</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          , Su_,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Goble</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Why linked data is not enough for scientists</article-title>
          .
          <source>Future Generation Computer Systems</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Garijo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          “
          <article-title>A New Approach for Publishing Workflows: Abstractions, Standards, and Linked Data”</article-title>
          .
          <source>In Proc. WORKS'11</source>
          ,
          <string-name>
            <surname>Seatle</surname>
          </string-name>
          , WA,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Oberle</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lapmarter</surname>
            , Grimm,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vrandecic</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Staab</surname>
            ,
            <given-names>S</given-names>
          </string-name>
          , Gangemi,
          <string-name>
            <surname>A.</surname>
          </string-name>
          “
          <article-title>Towards Ontologies for Formalizing Modularization and Communication in Large Software Systems”</article-title>
          .
          <source>Applied Ontology</source>
          <volume>1</volume>
          ,
          <fpage>163</fpage>
          -
          <lpage>202</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>