Abstract
We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stop-watch automata. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Dima, C., & Lanotte, R. (2007). Distributed time-asynchronous automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4711 LNCS, pp. 185–200). Springer Verlag. https://doi.org/10.1007/978-3-540-75292-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
