Theoretical Computer Science
Theoretical Computer Science - Special issue on hybrid systems
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Accepting Zeno words: a way toward timed refinements
Acta Informatica
Journal of the ACM (JACM)
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Kleene theorem for splitable signals
Information Processing Letters
Intersection of regular signal-event (timed) languages
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Timed substitutions for regular signal-event languages
Formal Methods in System Design
Intersection of regular signal-event (timed) languages
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
In the classical framework of formal languages, a refinement operation is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studied, because they describe a change in the specification level, from an abstract view to a more concrete one, or conversely. For timed systems, there is up to now no uniform notion of substitutions. In this paper, we study the timed substitutions in the general framework of signal-event languages, where both signals and events are taken into account. We prove that regular signal-event languages are closed under substitutions and inverse substitutions.