A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
An efficient search algorithm to find the elementary circuits of a graph
Communications of the ACM
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
Formal Design and Analysis of a Gear Controller
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
On the Composition of Hybrid Systems
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Relating Time Progress and Deadlines in Hybrid Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Formal Verification of a TDMA Protocol Start-Up Mechanism
PRFTS '97 Proceedings of the 1997 Pacific Rim International Symposium on Fault-Tolerant Systems
Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Enumeration of the Elementary Circuits of a Directed Graph
Enumeration of the Elementary Circuits of a Directed Graph
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
Analysis of a biphase mark protocol with Uppaal and PVS
Formal Aspects of Computing
Efficient detection of Zeno runs in timed automata
FORMATS'07 Proceedings of the 5th 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
| Hi-index | 0.00 |
This paper addresses Zeno runs, i.e., transition sequences that can execute arbitrarily fast, in the context of model checking with the UPPAAL tool. Zeno runs conflict with real-world experience where execution always takes time and they may introduce timelocks into the models. We enhance previous work on static detection of Zeno runs by extending synchronization exploitation using a synchronization matrix that not only ensures valid synchronization partners exist but also that their number is correct. Additionally, we introduce two data-variable heuristics into the analysis as in most models data-variable constraints prevent certain Zeno runs. The analysis is implemented in a tool called ZenoTool and empirically evaluated using 13 benchmarks. The evaluation shows that our analysis is more accurate in 3 cases and never less accurate than the analysis results of previous work and that performance and memory overhead are at the same time very low.