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.
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th Symp. on Foundations of Computer Science, pp. 100–109. IEEE Computer Society, 1997. Full version in Compositionality-The Significant Difference. Springer-Verlag Lecture Notes in Computer Science, 1998.
J. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4:638–648, 1992.
J.Y. Halpern and R. Fagin. Modeling knowledge and action in distributed systems. Distributed Computing, 3:159–179, 1989.
M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proc. 36rd Symp. on Foundations of Computer Science, pp. 453–462. IEEE Computer Society, 1995.
N. Immerman. Number of quantifiers is better than number of tape cells. J. Computer and System Sciences, 22:384–406, 1981.
O. Kupferman and M.Y. Vardi. Verification of fair transition systems. Chicago J. Theoretical Computer Science, 1998(2).
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Joint Conf. on Artificial Intelligence, pp. 481–489. British Computer Society, 1971.
R. Milner. Operational and algebraic semantics of concurrent processes. In Handbook of Theoretical Computer Science, Vol. B, pp. 1201–1242. Elsevier, 1990.
D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267–276, 1987.
D.E. Muller and P.E. Schupp. Simulating alternating tree automata by nondeterministic automata: new results and new proofs of theorems of Rabin, McNaughton, and Safra. Theoretical Computer Science, 141:69–107, 1995.
L.S. Shapley. Stochastic games. In Proc. National Academy of Science, 39:1095–1100, 1953.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. Computer and System Sciences, 32:182–221, 1986.
M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1–37, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y. (1998). Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055622
Download citation
DOI: https://doi.org/10.1007/BFb0055622
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64896-3
Online ISBN: 978-3-540-68455-8
eBook Packages: Springer Book Archive