A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization

Shibashis Guha
(Indian Institute of Technology Delhi)
Shankara Narayanan Krishna
(Indian Institute of Technology Bombay)
Chinmay Narayan
(Indian Institute of Technology Delhi)
S. Arun-Kumar
(Indian Institute of Technology Delhi)

In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states. We propose a zone based method for deciding these relations in which we eliminate an explicit product construction of the region graphs or the zone graphs as in the classical methods. Our method is also generic and can be used to decide several timed relations. We also present a game characterization for these timed relations and show that the game hierarchy reflects the hierarchy of the timed relations. One can obtain an infinite game hierarchy and thus the game characterization further indicates the possibility of defining new timed relations which have not been studied yet. The game characterization also helps us to come up with a formula which encodes the separation between two states that are not timed bisimilar. Such distinguishing formulae can also be generated for many relations other than timed bisimilarity.

In Johannes Borgström and Bas Luttik: Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics (EXPRESS/SOS 2013), Buenos Aires, Argentina, 26th August, 2013, Electronic Proceedings in Theoretical Computer Science 120, pp. 47–62.
Published: 26th July 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.120.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org