Distributed games with causal memory are decidable for series-parallel systems
From MaRDI portal
Recommendations
Cited in
(20)- Synthesis in presence of dynamic links
- Solving high-level Petri games
- On Distributed Monitoring and Synthesis
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Automated synthesis of distributed controllers
- Bounded synthesis for Petri games
- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
- On Distributed Program Specification and Synthesis in Architectures with Cycles
- scientific article; zbMATH DE number 7455739 (Why is no real title available?)
- Distributed Asynchronous Games With Causal Memory are Undecidable
- Automated synthesis: a distributed viewpoint
- scientific article; zbMATH DE number 7278100 (Why is no real title available?)
- On the control of asynchronous automata
- Petri games: synthesis of distributed systems with causal memory
- Translating asynchronous games for distributed synthesis
- LATIN 2004: Theoretical Informatics
- High-level representation of benchmark families for Petri games
- Asynchronous transition system games for two processes and their analysis
- Distributed controller synthesis for deadlock avoidance
- Distributed synthesis for well-connected architectures
This page was built for publication: Distributed games with causal memory are decidable for series-parallel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465860)