A study on shuffle, stopwatches and independently evolving clocks

DOI10.1007/s00446-011-0148-2zbMath1277.68179OpenAlexW2014909140MaRDI QIDQ1938360

Ruggero Lanotte, Catalin Dima

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

A menagerie of timed automata

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

This page was built for publication: A study on shuffle, stopwatches and independently evolving clocks