Automata and Games for Synthesis
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Decidable Class of Asynchronous Distributed Controllers
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Undecidable problems of decentralized observation and control on regular languages
Information Processing Letters
Tools for design of composite Web services
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Automated composition of e-services: lookaheads
Proceedings of the 2nd international conference on Service oriented computing
PSPACE-completeness of Modular Supervisory Control Problems
Discrete Event Dynamic Systems
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
SMT-based synthesis of distributed systems
Proceedings of the second workshop on Automated formal methods
On the (High) Undecidability of Distributed Synthesis Problems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
Automatic verification of database-driven systems: a new frontier
Proceedings of the 12th International Conference on Database Theory
Distributed synthesis for well-connected architectures
Formal Methods in System Design
Automatic synthesis of a global behavior from multiple distributed behaviors
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Synthesis of asynchronous systems
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Information flow in concurrent games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Distributed synthesis for alternating-time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
From asynchronous to synchronous specifications for distributed program synthesis
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Information Tracking in Games on Graphs
Journal of Logic, Language and Information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Synthesis of distributed control through knowledge accumulation
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Distributed synthesis for regular and contextfree specifications
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Distributed synthesis for well-connected architectures
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Semi-automatic distributed synthesis
ATVA'05 Proceedings of the Third 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
Mechanical verification of automatic synthesis of fault-tolerant programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Tree automata and discrete distributed games
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
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 for probabilistic environments
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Application of automated revision for UML models: a case study
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
Action-based discovery of satisfying subsets: A distributed method for model correction
Information and Software Technology
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
MR4UM: A framework for adding fault tolerance to UML state diagrams
Theoretical Computer Science
Asynchronous games over tree architectures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Diversely enumerating system-level architectures
Proceedings of the Eleventh ACM International Conference on Embedded Software
Distributed synthesis is simply undecidable
Information Processing Letters
Hi-index | 0.00 |
Abstract: In system synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is distributed, the goal is to construct the system's underlying processes. Results on multi-player games imply that the synthesis problem for linear specifications is undecidable for general architectures, and is nonelementary decidable for hierarchical architectures, where the processes are linearly ordered and information among them flows in one direction. In this paper we present a significant extension of this result. We handle both linear and branching specifications, and we show that a sufficient condition for decidability of the synthesis problem is a linear or cyclic order among the processes, in which information flows in either one or both directions. We also allow the processes to have internal hidden variables, and we consider communications with and without delay. Many practical applications fall into this class.