Summary: Alternating Refinement Relations ?
Rajeev Alur 1 Thomas A. Henzinger 2 Orna Kupferman 2 Moshe Y. Vardi 3
1 Department of Computer and Information Science,
University of Pennsylvania, Philadelphia, PA 19104, U.S.A.
Email: alur@cis.upenn.edu. URL: www.cis.upenn.edu/”alur.
2 Department of Electrical Engineering and Computer Sciences,
University of California, Berkeley, CA 94720­1770, U.S.A.
Email: ftah,ornag@eecs.berkeley.edu. URL: www.eecs.berkeley.edu/”ftah,ornag.
3 Department of Computer Science,
Rice University, Houston, TX 77005­1892, U.S.A.
Email: vardi@cs.rice.edu. URL: http://www.cs.rice.edu/”vardi.
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 tran­
sition 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 par­
ticular, we generalize the definitions of the simulation and trace containment preorders

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Vardi, Moshe Y. - Department of Computer Science, Rice University

Collections: Computer Technologies and Information Sciences