Occam's Razor Applied to the Petri Net Coverability Problem

The verification of safety properties for concurrent systems often reduces to the coverability problem for Petri nets. This problem was shown to be ExpSpace-complete forty years ago. Driven by the concurrency revolution, it has regained a lot of interest over the last decade. In this paper, we propose a generic and simple approach to solve this problem. Our method is inspired from the recent approach of Blondin, Finkel, Haase and Haddad. Basically, we combine forward invariant generation techniques for Petri nets with backward reachability for well- structured transition systems. An experimental evaluation demonstrates the efficiency of our approach.

[1]  Daniel Kroening,et al.  Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs , 2011, CAV.

[2]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[3]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[4]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[5]  Manuel Silva Suárez,et al.  Autonomous Continuous P/T Systems , 1999, ICATPN.

[6]  Daniel Kroening,et al.  A Widening Approach to Multithreaded Program Verification , 2014, ACM Trans. Program. Lang. Syst..

[7]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[8]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[9]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[10]  Michael Mendler,et al.  Propositional Lax Logic , 1997, Inf. Comput..

[11]  C.-H. Luke Ong,et al.  Automatic Verification of Erlang-Style Concurrency , 2013, SAS.

[12]  Alain Finkel,et al.  Approaching the Coverability Problem Continuously , 2016, TACAS.

[13]  Rupak Majumdar,et al.  An SMT-Based Approach to Coverability Analysis , 2014, CAV.

[14]  Serge Haddad,et al.  Complexity Analysis of Continuous Petri Nets , 2013, Fundam. Informaticae.

[15]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..