Thumbnail

Intersection of Regular Signal-Event (Timed) Languages

Bérard, Béatrice; Gastin, Paul; Petit, Antoine (2006), Intersection of Regular Signal-Event (Timed) Languages, in Asarin, Eugene; Bouyer, Patricia, Formal Modeling and Analysis of Timed Systems. 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings, Springer : Berlin, p. 52-66. http://dx.doi.org/10.1007/11867340_5

View/Open
Type
Communication / Conférence
Date
2006
Conference title
4th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2006)
Conference date
2006-09
Conference city
Paris
Conference country
France
Book title
Formal Modeling and Analysis of Timed Systems. 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings
Book author
Asarin, Eugene; Bouyer, Patricia
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
4202
Published in
Berlin
ISBN
978-3-540-45026-9
Number of pages
369
Pages
52-66
Publication identifier
Metadata
Show full item record
Author(s)
Bérard, Béatrice
Gastin, Paul
Petit, Antoine
Abstract (EN)
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.
Subjects / Keywords
signal-event languages