Skip to Main content Skip to Navigation
Conference papers

Checking simulation relation between timed game automata

Peter Bulychev Alexandre David Kim Guldstrand Larsen Thomas Chatain 1
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak alternating simulation as a preorder between timed game automata, which preserves controllability. We define the rules of building a symbolic turn-based two-player game such that the existence of a winning strategy is equivalent to the simulation being satisfied. We also propose an on-the-fly algorithm for solving this game. This simulation checking method can be applied to the case of non-alternating or strong simulations as well. We illustrate our algorithm by a case study and report on results.
Document type :
Conference papers
Complete list of metadata
Contributor : Stefan Haar <>
Submitted on : Thursday, January 10, 2013 - 8:25:11 PM
Last modification on : Monday, April 26, 2021 - 4:24:02 PM

Links full text



Peter Bulychev, Alexandre David, Kim Guldstrand Larsen, Thomas Chatain. Checking simulation relation between timed game automata. Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), Sep 2009, Budapest, Hungary, Hungary. pp.73-87, ⟨10.1007/978-3-642-04368-0_8⟩. ⟨hal-00772638⟩



Record views