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.
|Title of host publication||Computer Aided Verification - 5th International Conference, CAV 1993, Proceedings|
|Number of pages||15|
|State||Published - 1993|
|Event||5th International Conference on Computer Aided Verification, CAV 1993 - Elounda, Greece|
Duration: 28 Jun 1993 → 1 Jul 1993
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||5th International Conference on Computer Aided Verification, CAV 1993|
|Period||28/06/93 → 1/07/93|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.