Comparing Timed C/E Systems with Timed Automata (Abstract)

We investigate the relationship between timed c/e systems and timed automata. We provide an effective function that associates to each timed c/e system an “equivalent” timed automaton. Equivalence has to be understood as describing the same set of trajectories. A benefit from providing such a function is that analysis tools developed for timed automata can now be applied to analyze timed c/e systems. We also provide an effective function that translates each timed automaton into an equivalent timed c/e system.

[1]  Ahmed Bouajjani,et al.  Temporal Logic + Timed Automata: Expressiveness and Decidability , 1995, CONCUR.

[2]  Stefan Kowalewski,et al.  Condition/Event Systems: a Powerful Paradigm for Timed and Untimed Discrete Models of Technical Systems , 1995, EUROSIM.

[3]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[5]  Bruce H. Krogh,et al.  On condition/event systems with discrete state realizations , 1991, Discret. Event Dyn. Syst..

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