Designing a LTL Model-Checker based on Unfolding Graphs

Abstract : In this paper, we present new technique designing to solve the on-the-fly model checking problem for linear temporal logic using unfolding graphs [4] and the two key algorithms presented in [2]. Our study is based on the recognition of stuttering behavior in a formula automaton and on the on-the-fly construction of an unfolding graph. Moreover, the characterization of different kinds of behaviors allows us to design efficient algorithms for the detection of accepting paths. We have extended our study to the use of the atomic proposition dead which holds for terminal states. Partial order techniques are not adapted to deal with this global property in the context of a LTL model checking.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01573169
Contributor : Lip6 Publications <>
Submitted on : Tuesday, August 8, 2017 - 4:36:39 PM
Last modification on : Thursday, March 21, 2019 - 1:09:45 PM

Links full text

Identifiers

Citation

Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud. Designing a LTL Model-Checker based on Unfolding Graphs. 21th International Conference on Applications and Theory of Petri Nets, Jun 2000, Aarhus, Denmark. pp.123-145, ⟨10.1007/3-540-44988-4_9⟩. ⟨hal-01573169⟩

Share

Metrics

Record views

79