Model Checking Using Net Unfoldings

In [8], McMillan described a technique for deadlock detection based on net unfoldings. We extend its applicability to the properties of a temporal logic with a possibility operator. The algorithm is based on Linear Programming. It compares favourably with other algorithms for the class of deterministic concurrent systems.

[1]  Bernhard von Stengel,et al.  The Asynchronous Committee Meeting Problem , 1993, WG.

[2]  Antti Valmari,et al.  Reduced Labelled Transition Systems Save Verification Effort , 1991, CONCUR.

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

[4]  Edmund M. Clarke,et al.  Reasoning about Networks with Many Identical Finite State Processes , 1989, Inf. Comput..

[5]  Rodney R. Howell,et al.  On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets , 1987, European Workshop on Applications and Theory of Petri Nets.

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

[7]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[8]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[9]  Luca Bernardinello,et al.  A survey of basic net models and modular net classes , 1992, Advances in Petri Nets: The DEMON Project.

[10]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[11]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[12]  Javier Esparza.  A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming , 1992, Inf. Process. Lett..

[13]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[14]  Javier Esparza,et al.  Model Checking of Persistent Petri Nets , 1991, CSL.

[15]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[16]  Glynn Winskel,et al.  Compositional checking of satisfaction , 1991, Formal Methods Syst. Des..

[17]  Hsu-Chun Yen,et al.  An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems , 1987, Inf. Process. Lett..

[18]  Edmund M. Clarke,et al.  Reasoning about networks with many identical finite-state processes , 1986, PODC '86.

[19]  Alexandre Yakovlev,et al.  Signal Graphs: From Self-Timed to Timed Ones , 1985, PNPM.

[20]  Hsu-Chun Yen.  A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets , 1991, Inf. Process. Lett..

[21]  Eike Best,et al.  Nonsequential Processes: A Petri Net View , 1988 .

[22]  Ekkart Kindler,et al.  Compositional Liveness Properties of EN-Systems , 1993, Application and Theory of Petri Nets.

[23]  Mikko Tiusanen.  Some unsolved problems in modelling self-timed circuits using Petri nets , 1988, Bull. EATCS.

[24]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[25]  Patrice Godefroid.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[26]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[27]  Peter H. Starke,et al.  Processes in Petri Nets , 1981, J. Inf. Process. Cybern..

[28]  Julian C. Bradfield.  Verifying temporal properties of systems with applications to petri nets , 1991 .

[29]  Faron Moller,et al.  Verification of Parallel Systems via Decomposition , 1992, CONCUR.

[30]  Jörg Desel,et al.  Shortest Paths in Reachability Graphs , 1993, Application and Theory of Petri Nets.

[31]  Edward L. Robertson,et al.  Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[32]  Hon Fung Li,et al.  Partial-Order Model Checking: A Guide for the Perplexed , 1991, CAV.

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

[34]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[35]  Rance Cleaveland,et al.  A Semantics Based Verification Tool for Finite State Systems , 1989, PSTV.