Fair simulation

Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani

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

47 Scopus citations

Abstract

The simulation preorder for labeled transition systems is defined locally as a game that relates states with their immediate successor states. Livehess assumptions about transition systems are typically modeled using fairness constraints. Existing notions of simulation for fair transition systems, however, are not local, and as a result, many appealing properties of the simulation preorder are lost. We extend the local definition of simulation to account for fairness: System S]airly simulates system Z if[in the simulation game, there is a strategy that matches with each fair computation of 2: A fair computation of S. Our definition enjoys a fully abstract semantics and has a logical characterization: S fairly simulates I iff every fair computation tree embedded in the unrolling of 2: Can be embedded also in the unrolling of S or, equivalently, iff every Fair-u formula satisfied by Z is satisfied also by S (VAFMC is the universal fragment of the alternation-free p-calculus). The locality of the deftnition leads us to a polynomial-time algorithm for checking fair simulation for finite-state systems with weak and strong fairness constraints. Finally, fair simulation implies fair trace-containment, and is therefore useful as an efficientlycomputable local criterion for proving linear-time abstraction hierarchies.

Original languageAmerican English
Title of host publicationCONCUR 1997
Subtitle of host publicationConcurrency Theory - 8th International Conference, Proceedings
EditorsAntoni Mazurkiewicz, Józef Winkowski
PublisherSpringer Verlag
Pages273-287
Number of pages15
ISBN (Print)3540631410, 9783540631415
DOIs
StatePublished - 1997
Externally publishedYes
Event8th International Conference on Concurrency Theory, CONCUR 1997 - Warsaw, Poland
Duration: 1 Jul 19974 Jul 1997

Publication series

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

Conference

Conference8th International Conference on Concurrency Theory, CONCUR 1997
Country/TerritoryPoland
CityWarsaw
Period1/07/974/07/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Fingerprint

Dive into the research topics of 'Fair simulation'. Together they form a unique fingerprint.

Cite this