Distributed Asynchronous Games With Causal Memory are Undecidable

DOI10.46298/LMCS-18(3:30)2022OpenAlexW4286892728MaRDI QIDQ5043589FDOQ5043589

Authors: Hugo Gimbert 

Publication date: 6 October 2022

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

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)