State space analysis of Petri nets with relation-algebraic methods

A large variety of systems can be modelled by Petri nets. Their formal semantics are based on linear algebra which in particular allows the calculation of a Petri net's state space. Since state space explosion is still a serious problem, efficiently calculating, representing, and analysing the state space is mandatory. We propose a formal semantics of Petri nets based on executable relation-algebraic specifications. Thereupon, we suggest how to calculate the markings reachable from a given one simultaneously. We provide an efficient representation of reachability graphs and show in a correct-by-construction approach how to efficiently analyse their properties. Therewith we cover two aspects: modelling and model checking systems by means of one and the same logic-based approach. On a practical side, we explore the power and limits of relation-algebraic concepts for concurrent system analysis.

[1]  Timo Latvala,et al.  Coping With Strong Fairness , 2000, Fundam. Informaticae.

[2]  Rudolf Berghammer,et al.  Realtion-Algebraic Analysis of Petri Nets with RELVIEW , 1996, TACAS.

[3]  Reiko Heckel,et al.  A Coalgebraic presentation of structured transition systems , 2001, Theor. Comput. Sci..

[4]  Peter G. Harrison,et al.  Response time densities in generalised stochastic petri net models , 2002, WOSP '02.

[5]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[6]  Ralf Behnke,et al.  RELVIEW - A System for Calculating With Relations and Relational Programming , 1998, FASE.

[7]  Ewa Orlowska,et al.  Relational Methods for Computer Science Applications , 2001 .

[8]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[9]  Rudolf Berghammer,et al.  Exact Computation of Minimum Feedback Vertex Sets with Relational Algebra , 2006, Fundam. Informaticae.

[10]  Peter H. Starke,et al.  Analyse von Petri-Netz-Modellen , 1990, Leitfäden und Monographien der Informatik.

[11]  Yao Li,et al.  Performance Petri net analysis of communications protocol software by delay-equivalent aggregation , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[12]  Javier Esparza,et al.  Unfolding Based Algorithms for the Reachability Problem , 2001, Fundam. Informaticae.

[13]  Holger Schlingloff,et al.  Relation Algebra and Modal Logics , 1997, Relational Methods in Computer Science.

[14]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[15]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[16]  Ewa Orlowska,et al.  A relational formalisation of a generic many—valued modal logic , 2001 .

[17]  Britta Kehden,et al.  Evaluating Sets of Search Points Using Relational Algebra , 2006, RelMiCS.

[18]  Javier Esparza,et al.  Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[19]  Alexander Fronk.  Using relation algebra for the analysis of Petri nets in a CASE tool based approach , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[20]  Thierry Massart,et al.  Infinite State Model Checking by Abstract Interpretation and Program Specialisation , 1999, LOPSTR.

[21]  Tadao Murata,et al.  Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis , 1994, IEEE Trans. Software Eng..

[22]  Kedar S. Namjoshi,et al.  On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[23]  Hans Fleischhack,et al.  Model Checking of Time Petri Nets Based on Partial Order Semantics , 1999, CONCUR.

[24]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[25]  Gunther Schmidt,et al.  Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.

[26]  Jordi Cortadella,et al.  Petri Net Analysis Using Boolean Manipulation , 1994, Application and Theory of Petri Nets.

[27]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[28]  Wolfgang Reisig,et al.  Lectures on Petri nets : advances in Petri nets , 1998 .

[29]  Javier Esparza,et al.  A New Unfolding Approach to LTL Model Checking , 2000, ICALP.

[30]  Rudolf Berghammer.  Relation-algebraic computation of fixed points with applications , 2006, J. Log. Algebraic Methods Program..