Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
MoDeST - A Modelling and Description Language for Stochastic Timed Systems
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
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
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
On the Composition of Hybrid Systems
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
The power of reachability testing for timed automata
Theoretical Computer Science
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
Timed automata with urgent transitions
Acta Informatica
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
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
MOTOR: the MODEST tool environment
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Statistical model checking for networks of priced timed automata
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Model-checking and simulation for stochastic timed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time progress conditions are expressed by invariants). More precisely, we translate networks of TAD to the modeling language of Uppaal , a state-of-the-art verification tool for timed automata. We also describe an implementation of this translation, which allows Uppaal to aid the design and analysis of TAD models.