Adapting Petri Nets Reductions to Promela Specifications

Abstract : The interleaving of concurrent processes actions leads to the well-known combinatorial explosion problem. Petri nets theory provides some structural reductions to tackle this phenomenon by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that does not observe the modified transitions. Furthermore, they can be combined with other kinds of reductions such as partial-order techniques to improve the efficiency of state space reduction. We present in this paper an adaptation of these reductions for Promela specifications and propose simple rules to automatically infer atomic steps in the Promela model while preserving the checked property. We demonstrate on typical examples the efficiency of this approach and propose some perspectives of this work in the scope of software model checking.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Wednesday, April 20, 2016 - 3:01:46 PM
Last modification on : Thursday, March 21, 2019 - 1:19:39 PM

Links full text



Christophe Pajault, Jean-François Pradat-Peyre, Pierre Rousseau. Adapting Petri Nets Reductions to Promela Specifications. Formal Techniques for Networked and Distributed Systems - FORTE 2008, 28th IFIP WG 6.1 International Conference, Jun 2008, Tokyo, Japan. pp.84-98, ⟨10.1007/978-3-540-68855-6_6⟩. ⟨hal-01304972⟩



Record views