Alternating refinement relations

R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–178.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
; ; ;
Series Title
LNCS
Abstract
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system components. Unlike in labeled transition systems, where each transition corresponds to a possible step of the system (which may involve some or all components), in alternating transition systems, each transition corresponds to a possible move in a game between the components. In this paper, we study refinement relations between alternating transition systems, such as “Does the implementation refine the set A of specification components without constraining the components not in A?” In particular, we generalize the definitions of the simulation and trace containment preorders from labeled transition systems to alternating transition systems. The generalizations are called alternating simulation and alternating trace containment. Unlike existing refinement relations, they allow the refinement of individual components within the context of a composite system description. We show that, like ordinary simulation, alternating simulation can be checked in polynomial time using a fixpoint computation algorithm. While ordinary trace containment is PSPACE-complete, we establish alternating trace containment to be EXPTIME-complete. Finally, we present logical characterizations for the two preorders in terms of ATL, a temporal logic capable of referring to games between system components.
Publishing Year
Date Published
1998-01-01
Acknowledgement
This work is supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grants CCR-9504469, CCR-9628400, and CCR-9700061, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, by the SRC contract 97-DC-324.041, and by a grant from the Intel Corporation.
Volume
1466
Page
163 - 178
Conference
CONCUR: Concurrency Theory
IST-REx-ID

Cite this

Alur R, Henzinger TA, Kupferman O, Vardi M. Alternating refinement relations. In: Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:163-178. doi:10.1007/BFb0055611
Alur, R., Henzinger, T. A., Kupferman, O., & Vardi, M. (1998). Alternating refinement relations (Vol. 1466, pp. 163–178). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055611
Alur, Rajeev, Thomas A Henzinger, Orna Kupferman, and Moshe Vardi. “Alternating Refinement Relations,” 1466:163–78. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. https://doi.org/10.1007/BFb0055611.
R. Alur, T. A. Henzinger, O. Kupferman, and M. Vardi, “Alternating refinement relations,” presented at the CONCUR: Concurrency Theory, 1998, vol. 1466, pp. 163–178.
Alur R, Henzinger TA, Kupferman O, Vardi M. 1998. Alternating refinement relations. CONCUR: Concurrency Theory, LNCS, vol. 1466. 163–178.
Alur, Rajeev, et al. Alternating Refinement Relations. Vol. 1466, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–78, doi:10.1007/BFb0055611.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar