Determinizing Büchi asynchronous automata

DOI10.1007/3-540-60692-0_67MaRDI QIDQ2956703zbMATH OpenOpenAlexFDO

Authors

Publication date 19 January 2017

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

Full work available at URL https://doi.org/10.1007/3-540-60692-0_67

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Determinizing asynchronous automata
• On the complementation of asynchronous cellular Büchi automata
• On the complementation of Büchi asynchronous cellular automata
• Optimal Zielonka-type construction of deterministic asynchronous automata
• Distributed Asynchronous Automata

Cited in

(12)

• On the complementation of Büchi asynchronous cellular automata
• Keeping track of the latest gossip in a distributed system
• Deterministic asynchronous automata for infinite traces
• Traces of Control-Flow Graphs
• Compositional synthesis of asynchronous automata
• Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
• scientific article; zbMATH DE number 3497800 (Why is no real title available?)
• Distributed Asynchronous Automata
• On the complementation of asynchronous cellular Büchi automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• scientific article; zbMATH DE number 3995056 (Why is no real title available?)
• Determinizing asynchronous automata

This page was built for publication: Determinizing Büchi asynchronous automata

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