Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492900zbMATH OpenOpenAlexFDO

Authors Rémi Morin

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

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

• scientific article; zbMATH DE number 3995056
• 2-asynchronous automata
• scientific article; zbMATH DE number 1512617
• Probabilistic asynchronous automata
• Notes on finite asynchronous automata

Cited in

(11)

• A counterexample to Thiagarajan's conjecture on regular event structures
• A geometric view of partial order reduction
• scientific article; zbMATH DE number 6687767 (Why is no real title available?)
• Distributed Asynchronous Automata
• MSO Logic for Unambiguous Shared-Memory Systems
• Semantics of Deterministic Shared-Memory Systems
• scientific article; zbMATH DE number 4085029 (Why is no real title available?)
• CONCURRENT AUTOMATA AND DOMAINS
• Asynchronous trace-matching automata
• Compositional synthesis of asynchronous automata
• The categorical contours of the Chomsky-Schützenberger representation theorem

This page was built for publication: Mathematical Foundations of Computer Science 2005

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