×

zbMATH — the first resource for mathematics

On conciseness of extensions of timed automata. (English) Zbl 1146.68384
Summary: We study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models.

MSC:
68Q45 Formal languages and automata
68Q60 Specification and verification (program logics, model checking, etc.)
Software:
Uppaal
PDF BibTeX XML Cite