Coarse Abstractions Make Zeno Behaviours Difficult to Detect
An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno. Over the years important improvements have been obtained in checking reachability properties for timed automata. We show that some of these very efficient optimizations make testing for Zeno runs costly. In particular we show NP-completeness for the LU-extrapolation of Behrmann et al. We analyze the source of this complexity in detail and give general conditions on extrapolation operators that guarantee a (low) polynomial complexity of Zenoness checking. We propose a slight weakening of the LU-extrapolation that satisfies these conditions.
Unable to display preview. Download preview PDF.
- 3.Behrmann, G., David, A., Larsen, K.G., Haakansson, J., Pettersson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: QEST, pp. 125–126. IEEE Computer Society, Los Alamitos (2006)Google Scholar
- 9.Herbreteau, F., Srivathsan, B.: Coarse abstractions make zeno behaviours difficult to detect. CoRR abs/1106.1850 (2011); Extended version with proofsGoogle Scholar
- 13.Tripakis, S.: Checking timed Büchi emptiness on simulation graphs. ACM Trans. on Computational Logic 10(3) (2009)Google Scholar
- 15.Wang, F.: Redlib for the formal verification of embedded systems. In: ISoLA, pp. 341–346. IEEE, Los Alamitos (2006)Google Scholar