Distributed Asynchronous Games With Causal Memory are Undecidable

DOI10.46298/LMCS-18(3:30)2022MaRDI QIDQ5043589zbMATH OpenOpenAlexFDO

Authors Hugo Gimbert

Publication date 6 October 2022

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2110.14768

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• On the control of asynchronous automata
• Asynchronous Games over Tree Architectures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 1927560

Cites work

• scientific article; zbMATH DE number 7278100 (Why is no real title available?)
• scientific article; zbMATH DE number 5587278 (Why is no real title available?)
• scientific article; zbMATH DE number 7649934 (Why is no real title available?)
• scientific article; zbMATH DE number 7830376 (Why is no real title available?)
• 1-safe Petri nets and special cube complexes. Equivalence and applications
• A variant of a recursively unsolvable problem
• Asynchronous Games over Tree Architectures
• Automated synthesis of distributed controllers
• Distributed synthesis for acyclic architectures
• Distributed synthesis is simply undecidable
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Notes on finite asynchronous automata
• On the control of asynchronous automata
• Petri games: synthesis of distributed systems with causal memory
• Rabin's theorem in the concurrency setting: a conjecture

This page was built for publication: Distributed Asynchronous Games With Causal Memory are Undecidable

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