Occam's Razor applied to the Petri net coverability problem

Thomas Geffroy (1) , Jérôme Leroux (1) , Grégoire Sutre (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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 presented at TACAS in 2016. 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.

Mots clés: Petri net; Coverability problem; Model-checking; Invariant; Pre-processing

Domaines: Logique en informatique [cs.LO]; Théorie et langage formel [cs.FL]

Thomas Geffroy, Jérôme Leroux, Grégoire Sutre. Occam's Razor applied to the Petri net coverability problem. Theoretical Computer Science, 2018, 750, pp.38-52. ⟨10.1016/j.tcs.2018.04.014⟩. ⟨hal-02390655⟩