Concurrency in timed automata

✍ Scribed by Ruggero Lanotte; Andrea Maggiolo-Schettini; Simone Tini

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 373 KB
• Volume: 309
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(03)00316-5

✦ Synopsis

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 di er w.r.t. the succinctness of the models. Moreover, we distinguish between subclasses that are polynomially closed w.r.t. ÿnite union and ÿnite intersection, and subclasses that do not have such properties.