Fair simulation

T.A. Henzinger, O. Kupferman, S. Rajamani, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 273–287.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
; ;
Series Title
LNCS
Abstract
The simulation preorder for labeled transition systems is defined locally as a game that relates states with their immediate successor states. Liveness 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 fairly simulates system I iff in the simulation game, there is a strategy that matches with each fair computation of I 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 I can be embedded also in the unrolling of S or, equivalently, iff every Fair-AFMC formula satisfied by I is satisfied also by S (AFMC is the universal fragment of the alternation-free -calculus). The locality of the definition 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.
Publishing Year
Date Published
1997-01-01
Acknowledgement
This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.
Volume
1243
Page
273 - 287
Conference
CONCUR: Concurrency Theory
IST-REx-ID

Cite this

Henzinger TA, Kupferman O, Rajamani S. Fair simulation. In: Vol 1243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1997:273-287. doi:10.1007/3-540-63141-0_19
Henzinger, T. A., Kupferman, O., & Rajamani, S. (1997). Fair simulation (Vol. 1243, pp. 273–287). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-63141-0_19
Henzinger, Thomas A, Orna Kupferman, and Sriram Rajamani. “Fair Simulation,” 1243:273–87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997. https://doi.org/10.1007/3-540-63141-0_19.
T. A. Henzinger, O. Kupferman, and S. Rajamani, “Fair simulation,” presented at the CONCUR: Concurrency Theory, 1997, vol. 1243, pp. 273–287.
Henzinger TA, Kupferman O, Rajamani S. 1997. Fair simulation. CONCUR: Concurrency Theory, LNCS, vol. 1243. 273–287.
Henzinger, Thomas A., et al. Fair Simulation. Vol. 1243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 273–87, doi:10.1007/3-540-63141-0_19.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar