Distributed Timed Automata
β Scribed by Padmanabhan Krishnan
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 921 KB
- Volume
- 28
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
We introduce the notion of Timed I/O Components as Timed Automata "Γ la" Alur \& Dill where an "admissible" I/O interface is declared. That notion has, what we consider, a key modeling property: non-zeno preservation under syntacticallycheckable "I/O compatibility" among interacting components. Also