Alternating Refinement Relations (1998) [62 citations — 11 self]
http://www.cs.huji.ac.il/~ornak/publications/concu
http://www.eecs.berkeley.edu/~tah/Publications/alt
http://www.cis.upenn.edu/~alur/Concur98.ps.gz
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Rajeev Alur and Thomas A. Henzinger and Orna Kupferman and Moshe Y. Vardi},
title = {Alternating Refinement Relations},
year = {1998}
}
Bookmarks
OpenURL
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 compon...
