On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Distributed Algorithms
The Book of Traces
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Distributed Versions of Linear Time Temporal Logic: A Trace Perspective
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Synthesizing Distributed Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Undecidable problems of decentralized observation and control on regular languages
Information Processing Letters
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Distributed synthesis for well-connected architectures
Formal Methods in System Design
Modular strategies for recursive game graphs
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
On distributed program specification and synthesis in architectures with cycles
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The MSO theory of connectedly communicating processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Distributed games with causal memory are decidable for series-parallel systems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We study the problem of synthesizing controllers in a natural distributed asynchronous setting: a finite set of plants interact with their local environments and communicate with each other by synchronizing on common actions. The controller-synthesis problem is to come up with a local strategy for each plant such that the controlled behaviour of the network meets a specification. We consider linear time specifications and provide, in some sense, a minimal set of restrictions under which this problem is effectively solvable: we show that the controller-synthesis problem under these restrictions is decidable while the problem becomes undecidable if any one or more of these three restrictions are dropped.