Abstract

Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based on infinite traces such that for each equivalence class, either all or none of the sequences satisfy the checked formula. We present an algorithm for constructing a state graph that contains at least one representative sequence for each equivalence class. This allows applying existing model checking algorithms to the reduced state graph rather than on the larger full state graph of the program. It also allows model checking under fairness assumptions, and exploits these assumptions to obtain smaller state graphs. A formula rewriting technique is presented to allow coarser equivalence relation among sequences, such that less representatives are needed. 1

Citations

529	Petri nets: an introduction - Reisig - 1985
350	F.B.: Defining liveness - Alpern, Schneider - 1985
243	A stubborn attack on state explosion - Valmari - 1992
152	Using partial orders for the efficient verification of deadlock freedom and safety properties - Godefroid, Wolper
133	Using partial orders to improve automatic verification methods - Godefroid
132	Stubborn sets for reduced state space generation, in “Tenth International Conference on Application and Theory of Petri Nets - VALMARI - 1989
52	How to cook a temporal proof system for your pet language - Manna, Pnueli - 1983
42	Appraising fairness in languages for distributed programming - Apt, Francez, et al. - 1988
41	Checking that finite-state concurrent programs satisfy their linear specification - Lichtenstein, Pnueli - 1985
29	Verification of distributed programs using representative interleaving sequences, Distributed Computing 6 - Katz, Peled - 1992
22	Verification of concurrent systems: function and timing - Overman - 1981
17	Fairness for non-interleaving concurrency - Kwiatkowska - 1989
9	Proving partial order liveness properties - Peled, Pnueli - 1990
8	Defining conditional independence using collapses, Theoretical Computer Science 101 - Katz, Peled - 1992
1	Sometimes' sometimes is as good as 'always', CONCUR'92, Stony Brook - Peled - 1992