×

Trace abstraction refinement for timed automata. (English) Zbl 1448.68279

Cassez, Franck (ed.) et al., Automated technology for verification and analysis. 12th international symposium, ATVA 2014, Sydney, NSW, Australia, November 3–7, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8837, 396-410 (2014).
Summary: Timed automata are a well known formalism for modeling real-time systems. Model checking of timed automata is important for ensuring that the systems satisfy certain properties. Safety is one of the most important properties for timed automata. In this paper we propose a method for the safety checking of timed automata, which is an adaptation of the general trace abstraction refinement framework to timed automata. The feature of our work is that we use zone-based LU-abstraction instead of interpolation techniques. This method performs zone computation only when necessary, and the abstraction on zones is coarser because only part of the control structure is considered when computing LU-bounds. We give an example to show when this method could perform more efficiently than the traditional zone-based search algorithm.
For the entire collection see [Zbl 1325.68014].

MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI