Bounded determinization of timed automata with silent transitions

Florian Lukas Lorber, Amnon Rosenmann, Dejan Nickovic, Bernhard Aichernig

Research output: Contribution to journalArticle

Abstract

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. We show how to apply the approach in a fault-based test-case generation method, called model-based mutation testing, that was previously restricted to deterministic timed automata. The approach is implemented in a prototype tool and evaluated on several scientific examples and one industrial case study. To our best knowledge, this is the first implementation of this type of procedure for timed automata.
Original languageEnglish
Pages (from-to)291–326
JournalReal-time systems
Volume53
Issue number3
DOIs
Publication statusPublished - May 2017

Keywords

  • Timed automata
  • Determinization
  • Silent transition removal
  • Diagonal constraints
  • Testcase generation
  • Model-based testing
  • nodel-based mutation testing

Fingerprint Dive into the research topics of 'Bounded determinization of timed automata with silent transitions'. Together they form a unique fingerprint.

Cite this