Timed Formal Languages - A Framework for Hybrid Systems

Abstract A framework for hybrid systems is proposed. It is based on the notion of a timed formal language and language-theoretic operations. Representing timed behavior by explicit linguistic formulae or by equations on timed languages may be an alternative to the standard approach based on transition systems. It is shown how to specify the behavior of timed automata in these two ways — by timed regular expressions and by quasilinear language equations.

[1]  Li Xuandong,et al.  Hybrid Regular Expressions , 1998 .

[2]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[3]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

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

[5]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[6]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[7]  Paul Caspi,et al.  A Kleene theorem for timed automata , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[8]  Eugene Asarin.  Equations on Timed Languages , 1998, HSCC.