Symbolic and Structural Model-Checking - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2022

Symbolic and Structural Model-Checking

Yann Thierry-Mieg


Brute-force model-checking consists in exhaustive exploration of the state-space of a Petri net, and meets the dreaded state-space explosion problem. In contrast, this paper shows how to solve model-checking problems using a combination of techniques that stay in complexity proportional to the size of the net structure rather than to the state-space size. We combine an SMT based over-approximation to prove that some behaviors are unfeasible, an under-approximation using memory-less sampling of runs to find witness traces or counter-examples, and a set of structural reduction rules that can simplify both the system and the property. This approach was able to win by a clear margin the model-checking contest 2020 for reachability queries as well as deadlock detection, thus demonstrating the practical effectiveness and general applicability of the system of rules presented in this paper.
Fichier principal
Vignette du fichier
zbyrkmgbmhjxwhydzpkqmdmckfxhxgqm.pdf (301.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03147423 , version 1 (22-02-2021)
hal-03147423 , version 2 (09-01-2023)



Yann Thierry-Mieg. Symbolic and Structural Model-Checking. Fundamenta Informaticae, 2022, 183 (3-4), pp.319-342. ⟨10.3233/FI-2021-2090⟩. ⟨hal-03147423v2⟩
129 View
127 Download



Gmail Facebook X LinkedIn More