A study on shuffle, stopwatches and independently evolving clocks
From MaRDI portal
Publication:1938360
DOI10.1007/s00446-011-0148-2zbMath1277.68179MaRDI QIDQ1938360
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0148-2
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- What's decidable about hybrid automata?
- A theory of timed automata
- An algebraic approach to data languages and timed languages
- Updatable timed automata
- Scheduling with timed automata
- Schedulability analysis of fixed-priority systems using timed automata
- Task automata: Schedulability, decidability and undecidability
- Timed regular expressions
- Distributed Time-Asynchronous Automata
- Distributed Timed Automata with Independently Evolving Clocks
- Interrupt Timed Automata
- Notes on finite asynchronous automata
- Computational Logic in Multi-Agent Systems
- CONCUR 2005 – Concurrency Theory