Removing epsilon-Transitions in Timed Automata

Timed automata are among the most widely studied models for real-time systems. Silent transitions, i.e., e-transitions, have already been proposed in the original paper on timed automata by Alur and Dill

[1]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[2]  Paul Gastin,et al.  On the Power of Non-Observable Actions in Timed Automata , 1996, STACS.

[3]  Mihalis Yannakakis,et al.  Minimum and maximum delay problems in real-time systems , 1991, Formal Methods Syst. Des..

[4]  Thomas A. Henzinger,et al.  A Determinizable Class of Timed Automata , 1994, CAV.

[5]  Rajeev Alur,et al.  Minimization of Timed Transition Systems , 1992, CONCUR.

[6]  Thomas A. Henzinger,et al.  The Expressive Power of Clocks , 1995, ICALP.

[7]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[8]  Béatrice Bérard,et al.  Untiming Timed Languages , 1995, Inf. Process. Lett..

[9]  Thomas A. Henzinger,et al.  Back to the future: towards a theory of timed regular languages , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  H. Wong-Toi,et al.  The control of dense real-time discrete event systems , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[11]  Thomas Wilke,et al.  Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata , 1994, FTRTFT.