Alternating Refinement Relations

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

• Type: Conference
• Year: 1998
• Where: CONCUR
• Authors: Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi
• Keywords: CONCUR 1998, Distributed And Parallel Computing, Systemsto Alternating Transition, Trace Containment, Transition Systems