Reachability via Compositionality in Petri nets

We introduce a novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets. We prove that the technique is correct, and discuss our implementation. We report promising experimental results on some well-known examples.

[1]  Roberto Bruni,et al.  Connector algebras for C/E and P/T nets' interactions , 2013, Log. Methods Comput. Sci..

[2]  Pawel Sobocinski,et al.  Representations of Petri Net Interactions , 2010, CONCUR.

[3]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[4]  Uday S. Reddy,et al.  Global state considered unnecessary: An introduction to object-based semantics , 1996, LISP Symb. Comput..

[5]  P. H. Starke,et al.  Reachability analysis of Petri nets using symmetries , 1991 .

[6]  Karsten Wolf.  How to calculate symmetries of Petri nets , 2000, Acta Informatica.

[7]  Javier Esparza,et al.  Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[8]  Maciej Koutny,et al.  Canonical prefixes of Petri net unfoldings , 2002, Acta Informatica.

[9]  Uday S. Reddy.  Global state considered unnecessary: An introduction to object-based semantics , 1996 .

[10]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[11]  Nicoletta Sabadini,et al.  Span(Graph): A Categorial Algebra of Transition Systems , 1997, AMAST.

[12]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[13]  Jens Palsberg,et al.  Complexity Results for 1-safe Nets , 1993, FSTTCS.

[14]  Javier Esparza,et al.  Implementing LTL model checking with net unfoldings , 2001, SPIN '01.

[15]  J. Brzozowski.  Canonical regular expressions and minimal state graphs for definite events , 1962 .

[16]  Nicoletta Sabadini,et al.  Representing Place/Transition Nets in Span(Graph) , 1997, AMAST.

[17]  Pawel Soboci 'nski.  A non-interleaving process calculus for multi-party synchronisation , 2009 .

[18]  Roberto Bruni,et al.  A Connector Algebra for P/T Nets Interactions , 2011, CONCUR.

[19]  Dan R. Ghica,et al.  The regular-language semantics of second-order , 2003 .

[20]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.