{"citation":{"ieee":"R. Alur, T. A. Henzinger, O. Kupferman, and M. Vardi, “Alternating refinement relations,” in <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, Nice, France, 1998, vol. 1466, pp. 163–178.","mla":"Alur, Rajeev, et al. “Alternating Refinement Relations.” <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, vol. 1466, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–78, doi:<a href=\"https://doi.org/10.1007/BFb0055622\">10.1007/BFb0055622</a>.","short":"R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–178.","ama":"Alur R, Henzinger TA, Kupferman O, Vardi M. Alternating refinement relations. In: <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>. Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:163-178. doi:<a href=\"https://doi.org/10.1007/BFb0055622\">10.1007/BFb0055622</a>","chicago":"Alur, Rajeev, Thomas A Henzinger, Orna Kupferman, and Moshe Vardi. “Alternating Refinement Relations.” In <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, 1466:163–78. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. <a href=\"https://doi.org/10.1007/BFb0055622\">https://doi.org/10.1007/BFb0055622</a>.","apa":"Alur, R., Henzinger, T. A., Kupferman, O., &#38; Vardi, M. (1998). Alternating refinement relations. In <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i> (Vol. 1466, pp. 163–178). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/BFb0055622\">https://doi.org/10.1007/BFb0055622</a>","ista":"Alur R, Henzinger TA, Kupferman O, Vardi M. 1998. Alternating refinement relations. Proceedings of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1466, 163–178."},"conference":{"start_date":"1998-09-08","name":"CONCUR: Concurrency Theory","location":"Nice, France","end_date":"1998-09-11"},"_id":"4603","language":[{"iso":"eng"}],"publication":"Proceedings of the 9th Interantional Conference on Concurrency Theory","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"full_name":"Vardi, Moshe","first_name":"Moshe","last_name":"Vardi"}],"doi":"10.1007/BFb0055622","page":"163 - 178","publication_identifier":{"isbn":["978-3-540-64896-3"]},"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.","intvolume":"      1466","volume":1466,"publist_id":"104","year":"1998","publication_status":"published","extern":"1","date_published":"1998-01-01T00:00:00Z","abstract":[{"text":"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.","lang":"eng"}],"type":"conference","day":"01","month":"01","article_processing_charge":"No","date_updated":"2022-08-23T09:50:34Z","title":"Alternating refinement relations","quality_controlled":"1","status":"public","alternative_title":["LNCS"],"oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:09:42Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1"}