Bounded Determinization of Timed Automata with Silent Transitions
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.
Unable to display preview. Download preview PDF.
- 1.Bernhard, K.: Aichernig and florian lorber. Towards generation of adaptive test cases from partial models of determinized timed automata. In: AMOST (2015)Google Scholar
- 11.Diekert, V., Gastin, P., Petit, A.: Removing epsilon-transitions in timed automata. In: STACS, pp. 583–594. Springer (1997)Google Scholar
- 15.Lorber, F., Rosenmann, A., Ničković, D., Aichernig, B.K.: Bounded determinization of timed automata with silent transitions. Technical Report IST-MBT-2015-01. Graz University of Technology, Institute for Software Technology (2015). https://goo.gl/YTjjnF