Intersection of Regular Signal-Event (Timed) Languages

We propose in this paper a construction for a “well known” result: regular signal-event languages are closed by intersection. In fact, while this result is indeed trivial for languages defined by Alur and Dill’s timed automata (the proof is an immediate extension of the one in the untimed case), it turns out that the construction is much more tricky when considering the most involved model of signal-event automata. While several constructions have been proposed in particular cases, it is the first time, up to our knowledge, that a construction working on finite and infinite signal-event words and taking into account signal stuttering, unobservability of zero-duration τ-signals and Zeno runs is proposed.

[1]  P. J. L. Cuijpers,et al.  Beyond Zeno-behaviour , 2001 .

[2]  Patricia Bouyer,et al.  Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..

[3]  Paul Gastin,et al.  Refinements and Abstractions of Signal-Event (Timed) Languages , 2006, FORMATS.

[4]  Paul Caspi,et al.  Timed regular expressions , 2002, JACM.

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

[6]  Catalin Dima,et al.  Real-Time Automata and the Kleene Algebra of Sets of Real Numbers , 2000, STACS.

[7]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[9]  Michael R. Hansen,et al.  Finite Divergence , 1995, Theor. Comput. Sci..

[10]  Paul Gastin,et al.  Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.

[11]  Jérôme Olivier Durand-Lose.  A Kleene theorem for splitable signals , 2004, Inf. Process. Lett..

[12]  Paul Gastin,et al.  Timed substitutions for regular signal-event languages , 2007, Formal Methods Syst. Des..