Abstract
We introduce Concurrent Timed Automata (CTAs) where automata running in parallel are synchronized. We consider the subclasses of CTAs obtained by admitting, or not, diagonal clock constraints and constant updates, and by letting, or not, sequential automata to update the same clocks. We prove that such subclasses recognize the same languages but differ from the point of view of succinctness.
Research partially supported by MURST Progetto Cofinanziato TOSCA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur and D.L. Dill: A theory of timed automata. Theoretical Computer Science 126, 183–235, 1994.
B. Bérard, V. Diekert, P. Gastin, and A. Petit: Characterization of the power of silent transitions in timed automata. Fundamenta Informaticae 36, 145–182, 1998.
S. Bornot and J. Sifakis: Relating time progress and deadlines in hybrid systems. In Proc. of HART’ 97, Springer LNCS 1201, 266–300, 1997.
S. Bornot and J. Sifakis: On the composition of hybrid systems. In Proc. of HSCC’ 98, Springer LNCS 1386, 69–83, 1998.
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit: Are timed automata updatable? In Proc. of CAV 2000, Springer LNCS 1855, 464–479, 2000.
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit: Expressiveness of updatable timed automata. In Proc. of MFCS 2000, Springer LNCS 1893, 232–242, 2000.
D. Drusinsky and D. Harel: On the power of bounded concurrency I: finite automata. Journal of the ACM 41, 217–539, 1994.
R. Lanotte, A. Maggiolo-Schettini, and A. Peron: Timed Cooperating Automata. Fundamenta Informaticae 43, 153–173, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lanotte, R., Maggiolo-Schettini, A., Tini, S. (2001). Concurrency in Timed Automata. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive