Timed automata are a convenient mathematical model for modelling and reasoning about real-time systems. While they provide a powerful way of representing timing aspects of such systems, timed automata assume arbitrary precision and zero-delay actions; in particular, a state might be declared reachable in a timed automaton, but impossible to reach in the physical system it models. In this paper, we consider permissive strategies as a way to overcome this problem: such strategies propose intervals of delays instead of single delays, and aim at reaching a target state whichever delay actually takes place. We develop an algorithm for computing the optimal permissiveness (and an associated maximally-permissive strategy) in acyclic timed automata and games.
CITATION STYLE
Clement, E., Jéron, T., Markey, N., & Mentré, D. (2020). Computing Maximally-Permissive Strategies in Acyclic Timed Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12288 LNCS, pp. 111–126). Springer. https://doi.org/10.1007/978-3-030-57628-8_7
Mendeley helps you to discover research relevant for your work.