Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal logic for real time systems
Temporal logic for real time systems
Using mappings to prove timing properties
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Temporal proof methodologies for real-time systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Information Processing Letters
Timed automata and recognizability
Information Processing Letters
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
The Expressive Power of Clocks
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Removing epsilon-Transitions in Timed Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
Pumping Lemmas for Timed Automata
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
From ATP to Timed Graphs and Hybrid Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
On the Power of Non-Observable Actions in Timed Automata
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Back to the future: towards a theory of timed regular languages
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
The expressive power of time Petri nets
Theoretical Computer Science
Model checking for probabilistic timed automata
Formal Methods in System Design
Hi-index | 0.00 |
Timed automata are among the most widely studied models for real-time systems. Silent transitions, i.e., ε-transitions, have already been proposed in the original paper on timed automata by Alur and Dill [3]. We show that the class TL ε of timed languages recognized by automata with ε-transitions, is more robust and more expressive than the corresponding class TL without ε-transitions. We then focus on ε-transitions without reset, i.e. ε-transitions which do not reset clocks. We propose an algorithm to construct, given a timed automaton, an equivalent one without such transitions. This algorithm is in two steps, it first suppresses the cycles of ε-transitions without reset and then the remaining ones. Then, we prove that a timed automaton such that no ε-transition which resets clocks lies on any directed cycle, can be effectively transformed into a timed automaton without εtransitions. Interestingly, this main result holds under the assumption of non-Zenoness and it is false otherwise. To complete the picture, we exhibit a simple timed automaton with an ε-transition, which resets some clock, on a cycle and which is not equivalent to any ε-free timed automaton. To show this, we develop a promising new technique based on the notion of precise action. This paper presents a synthesis of the two conference communications [9] and [13].