𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Timed automata and recognizability

✍ Scribed by Philippe Herrmann


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
555 KB
Volume
65
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Distributed Timed Automata
✍ Padmanabhan Krishnan πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 921 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

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

Timed automata with urgent transitions
✍ Roberto Barbuti; Luca Tesei πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 270 KB
Extending Timed Automata for Composition
✍ VΓ­ctor Braberman; Alfredo Olivero πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 382 KB

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