Verification of fair transition systems

Orna Kupferman, Moshe Y. Vardi

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

33 Scopus citations

Abstract

In program verification, we check that an implementation meets its specification. Both the specification and the implementation describe the possible behaviors of the program, though at different levels of abstraction. We distinguish between two approaches to implementation of specifications. The first approach is trace-based implementation, where we require every computation of the implementation to correlate to some computation of the specification. The second approach is tree-based implementation, where we require every computation tree embodied in the implemenration to correlate to some computation tree embodied in the specification. The two approaches to implementation are strongly related to the linear-time versus branching-time dichotomy in temporal logic. In this work we examine the trace-based and the tree-based approaches from a complexity-theoretic point of view. We consider and compare the complexity of verification of fair transition systems, modeling both the implementation and the specification, in the two approaches. We consider unconditional, weak, and strong fairness. For the trace-based approach, the corresponding problem is language containment. For the tree-based approach, the corresponding problem is fair simulation. We show that while both problems are PSPACE-complete, their complexities in terms of the size of the implementation do not coincide and the trace-based approach is more efficient. As the implementation is normally much bigger than the specification, we see this as an advantage of the trace-based approach. Our results are at variance with the known results for the case of transition systems with no fairness, where the tree-based approach is more efficient.

Original languageAmerican English
Title of host publicationComputer Aided Verification - 8th International Conference, CAV 1996, Proceedings
EditorsThomas A. Henzinger, Rajeev Alur
PublisherSpringer Verlag
Pages372-382
Number of pages11
ISBN (Print)3540614745, 9783540614746
DOIs
StatePublished - 1996
Externally publishedYes
Event8th International Conference on Computer Aided Verification, CAV 1996 - New Brunswick, United States
Duration: 31 Jul 19963 Aug 1996

Publication series

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

Conference

Conference8th International Conference on Computer Aided Verification, CAV 1996
Country/TerritoryUnited States
CityNew Brunswick
Period31/07/963/08/96

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.

Fingerprint

Dive into the research topics of 'Verification of fair transition systems'. Together they form a unique fingerprint.

Cite this