We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and Markov automata. The timed models and their bisimulation semantics are encoded in the framework of uniform labeled transition systems. In this unifying framework, we show that the timed bisimilarities present in the literature can be re-obtained and that a new bisimilarity, of which we exhibit the modal logic characterization, can be introduced for timed models including probabilities. We finally highlight similarities and differences among the models. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bernardo, M., & Tesei, L. (2013). Encoding timed models as uniform labeled transition systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8168 LNCS, pp. 104–118). Springer Verlag. https://doi.org/10.1007/978-3-642-40725-3_9
Mendeley helps you to discover research relevant for your work.