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.
KeywordsNormal Form Repeated State Instantaneous Event Silent Transition Clock Constraint
Unable to display preview. Download preview PDF.
- 3.Asarin, E., Caspi, P., Maler, O.: A Kleene theorem for timed automata. In: Proceedings of LICS 1997, pp. 160–171. IEEE Comp. Soc. Press, Los Alamitos (1997)Google Scholar
- 7.Bérard, B., Gastin, P., Petit, A.: Timed substitutions for regular signal-event languages. Research Report LSV-06-04, Laboratoire Spécification et Vérification, ENS Cachan, France (February 2006)Google Scholar
- 9.Cuijpers, P.J.L., Reniers, M.A., Engels, A.G.: Beyond zeno-behaviour. Technical Report CSR 01-04, Department of Computing Science, University of Technology, Eindhoven (2001)Google Scholar