<!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>SLAPN : A Tool for Slicing Algebraic Petri Nets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yasir Imtiaz Khan</string-name>
          <email>yasir.khan@uni.lu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicolas Guelfi</string-name>
          <email>nicolas.guelfi@uni.lu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Luxembourg, Laboratory of Advanced Software Systems 6</institution>
          ,
          <addr-line>rue R. Coudenhove-Kalergi</addr-line>
          ,
          <country country="LU">Luxembourg</country>
        </aff>
      </contrib-group>
      <fpage>343</fpage>
      <lpage>345</lpage>
      <abstract>
        <p>Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets, model checking and testing are used commonly. Petri nets slicing is getting an attention recently to improve the analysis of systems modelled in Petri nets or Algebraic Petri nets. This work is oriented to define Algebraic Petri nets slicing and implement it in a verification tool.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Introduction
Among several dedicated analysis techniques for Petri nets (PNs) and Algebraic
Petri nets (APNs) (i.e., an evolution to PNs), model checking and testing are
used more commonly. A typical drawback of model checking is its limits with
respect to the state space explosion problem. Similarly testing suffers with the
problems such as large input amount of test data, test case selection etc.</p>
      <p>Petri nets slicing is a technique that aims to improve the verification of
systems modelled in Petri nets. PNs slicing is used to syntactically reduce Petri
net model based on the given criteria. A criteria is a property for which Petri net
model is analysed. The sliced part constitutes only that part of the PN model
that may affect the criteria. Roughly, we can divide PN Slicing into two major
classes, which are</p>
      <p>Static Slicing: If the initial markings of places are not considered for
generating sliced net.</p>
      <p>Dynamic Slicing: If the initial markings of places are considered for
generating sliced net.</p>
      <p>
        One characteristic of APNs that makes them complex to slice is the use
of multisets of algebraic terms over the arcs. In principle, algebraic terms may
contain variables. Even though, we want to reach a syntactically reduced net (to
be semantically valid), its reduction by slicing, needs to determine the possible
ground substitutions of these algebraic terms. We use partial unfolding proposed
in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] to determine ground substitutions of the algebraic terms over the arcs of
an APN. In the first column of Table1, our proposed APN slicing algorithms
are shown [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. The second column represents properties that are preserved by
algorithm whereas in the last column slicing type is mentioned.
      </p>
      <p>PNSE’14 – Petri Nets and Software Engineering</p>
    </sec>
    <sec id="sec-2">
      <title>APN Slicing</title>
    </sec>
    <sec id="sec-3">
      <title>Liveness Slicing</title>
      <p>CTL* X
LTL X</p>
    </sec>
    <sec id="sec-4">
      <title>Livenss</title>
    </sec>
    <sec id="sec-5">
      <title>Static</title>
    </sec>
    <sec id="sec-6">
      <title>Static</title>
    </sec>
    <sec id="sec-7">
      <title>Static</title>
    </sec>
    <sec id="sec-8">
      <title>Concerned Slicing</title>
    </sec>
    <sec id="sec-9">
      <title>Particular</title>
    </sec>
    <sec id="sec-10">
      <title>Dynamic</title>
      <p>1.1</p>
      <p>SLAPNN Overview
First of all, an APN is partially unfolded and from the temporal description
of properties places are extracted (shown in Fig.1). Different slicing algorithms
such as abstract slicing, concerned slicing, APN slicing, safety slicing, liveness
slicing can be used to generate the slice (can be observed in the meta model of
SLAPN (shown in Fig.2)). Following steps an APN slice can be generate by the
tool.</p>
      <p>
        P1 [
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ] x
t1 x [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] P2
x
[] P3x t2
      </p>
      <p>APN Model
Partially unfold APN</p>
      <p>
        [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] P2
P
      </p>
      <p>
        1 t11
1 [
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ] 23 t12
t13
1
2
3
1 t21 t22 t23
23 1 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] 3P3
Unfolded APN Model
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] P2
      </p>
      <p>
        Conclusion and Future Work
– APN slicing can be used as a pre-processing step towards the verification
of systems modelled in APNs. The sliced APN model can then be used to
generate state space.
– Our work is the first effort to define and implement the proposed slicing
algorithms.
– As a future work, we consider to integrate SLAPN with the existing model
checkers such as AlPiNA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
– We intend to develop SLAPN as a generic tool over the PN classes such as
timed PN, colored PN.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>D.</given-names>
            <surname>Buchs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hostettler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marechal</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Risoldi</surname>
          </string-name>
          .
          <article-title>Alpina: A symbolic model checker</article-title>
          . In J. Lilius and W. Penczek, editors,
          <source>Applications and Theory of Petri Nets</source>
          , volume
          <volume>6128</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>287</fpage>
          -
          <lpage>296</lpage>
          . Springer Berlin Heidelberg,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Y. I. Khan.</surname>
          </string-name>
          <article-title>Slicing high-level petri nets</article-title>
          .
          <source>Technical Report TR-LASSY-14-03</source>
          , University of Luxembourg,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Y. I.</given-names>
            <surname>Khan</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Risoldi</surname>
          </string-name>
          .
          <article-title>Optimizing algebraic petri net model checking by slicing</article-title>
          .
          <source>International Workshop on Modeling and Business Environments (ModBE'13, associated with Petri Nets'13)</source>
          ,
          <year>2013</year>
          .
          <article-title>This work has been supported by the National Research Fund, Luxembourg, Project RESIsTANT, ref</article-title>
          .
          <source>PHD-MARP-10.</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>