๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Axiomatising timed automata

โœ Scribed by Huimin Lin; Wang Yi


Book ID
107706354
Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
235 KB
Volume
38
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Distributed Timed Automata
โœ Padmanabhan Krishnan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 921 KB
Shrinking timed automata
โœ Sankur, Ocan; Bouyer, Patricia; Markey, Nicolas ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 789 KB
Timed CSP = Closed Timed Automata1
โœ Joรซl Ouaknine; James Worrell ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

We study the expressive power of an augmented version of Timed CSP and show that it is precisely equal to that of closed timed automata-timed automata with closed invariant and enabling clock constraints. We also show that this new version of Timed CSP is expressive enough to capture the most widely

Timed automata and recognizability
โœ Philippe Herrmann ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 555 KB
Concurrency in timed automata
โœ Ruggero Lanotte; Andrea Maggiolo-Schettini; Simone Tini ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB

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 s