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
TypeCommunication / Conférence
Conference title4th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2006)
Book titleFormal Modeling and Analysis of Timed Systems. 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings
Book authorAsarin, Eugene; Bouyer, Patricia
Series titleLecture Notes in Computer Science
Number of pages369
MetadataShow full item record
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 deﬁned 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 ﬁrst time, up to our knowledge, that a construction working on ﬁnite and inﬁnite signal-event words and taking into account signal stuttering, unobservability of zero-duration τ -signals and Zeno runs is proposed.
Subjects / Keywordssignal-event languages
Showing items related by title and author.