All from one, one for all: On model checking using representatives

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

393 Scopus citations


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.

Original languageEnglish
Title of host publicationComputer Aided Verification - 5th International Conference, CAV 1993, Proceedings
EditorsCostas Courcoubetis
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540569220
StatePublished - 1993
Externally publishedYes
Event5th International Conference on Computer Aided Verification, CAV 1993 - Elounda, Greece
Duration: 28 Jun 19931 Jul 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume697 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Conference on Computer Aided Verification, CAV 1993

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.


Dive into the research topics of 'All from one, one for all: On model checking using representatives'. Together they form a unique fingerprint.

Cite this