Theoretical Computer Science
Multimedia in Temporal LOTOS: A Lip-Synchronization Algorithm
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Time and Action Lock Freedom Properties for Timed Automata
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
The power of reachability testing for timed automata
Theoretical Computer Science
Timed model checking of security protocols
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Specifying Urgency in Timed I/O Automata
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Analysis of the zeroconf protocol using UPPAAL
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Formal Aspects of Computing
Coarse abstractions make zeno behaviours difficult to detect
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Efficient emptiness check for timed büchi automata
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Efficient emptiness check for timed Büchi automata
Formal Methods in System Design
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Modeling and verifying hierarchical real-time systems using stateful timed CSP
ACM Transactions on Software Engineering and Methodology (TOSEM)
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Zeno runs, where infinitely many actions occur in finite time, may inadvertently arise in timed automata specifications. Zeno runs may compromise the reliability of formal verification, and few model-checkers provide the means to deal with them: this usually takes the form of liveness checks, which are computationally expensive. As an alternative, we describe here an efficient static analysis to assert absence of Zeno runs on Uppaal networks; this is based on Tripakis's strong non-Zenoness property, and identifies all loops in the automata graphs where Zeno runs may possibly occur. If such unsafe loops are found, we show how to derive an abstract network that over-approximates the loop behaviour. Then, liveness checks may assert absence of Zeno runs in the original network, by exploring the reduced state space of the abstract network. Experiments show that this combined approach may be much more efficient than running liveness checks on the original network.