Penrose: Putting Compositionality to Work for Petri Net Reachability

Recent work by the authors introduced a technique for reachability checking in Petri Nets, exploiting compositionality to increase performance for some well-known examples. We introduce a tool that uses this technique, Penrose, discuss some design details in its implementation, and identify potential future improvements.

[1]  Nicoletta Sabadini,et al.  Compositional Minimization in Span(Graph): Some Examples , 2004, Electron. Notes Theor. Comput. Sci..

[2]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

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

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

[5]  Nagisa Ishiura,et al.  Shared binary decision diagram with attributed edges for efficient Boolean function manipulation , 1990, 27th ACM/IEEE Design Automation Conference.

[6]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

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

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

[9]  Julian Rathke,et al.  Decomposing Petri nets , 2013, ArXiv.

[10]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[11]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

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

[13]  J. M. Foster,et al.  Mathematical theory of automata , 1965 .

[14]  Pawel Sobocinski,et al.  Reachability via Compositionality in Petri nets , 2013, ArXiv.