Distributed Time-Asynchronous Automata

DOI10.1007/978-3-540-75292-9_13MaRDI QIDQ3525084zbMATH OpenOpenAlexFDO

Authors Cătălin Dima, Ruggero Lanotte

Publication date 17 September 2008

Published in Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75292-9_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A study on shuffle, stopwatches and independently evolving clocks
• scientific article; zbMATH DE number 2050928
• Automata on distributed alphabets
• Distributed Asynchronous Automata
• A theory of timed automata

Cited in

(9)

• A study on shuffle, stopwatches and independently evolving clocks
• Distributed Timed Automata with Independently Evolving Clocks
• A survey of timed automata for the development of real-time systems
• Regular set of representatives for time-constrained MSC graphs
• scientific article; zbMATH DE number 2050928 (Why is no real title available?)
• scientific article; zbMATH DE number 3995056 (Why is no real title available?)
• Automata on distributed alphabets
• Distributed event clock automata (extended abstract)
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Distributed Time-Asynchronous Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525084)