Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about infinite computations
Information and Computation
Model checking
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Framework for Component-based Construction Extended Abstract
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Foundations of incremental aspect model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Automatic synthesis of a global behavior from multiple distributed behaviors
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
On the aggregation problem for synthesized web services
Proceedings of the 13th International Conference on Database Theory
Synthesis of loop-free programs
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Finite combinatory logic with intersection types
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
Correct and non-defensive glue design using abstract models
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Factorization for component-interaction automata
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Synthesizing probabilistic composers
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Template-Based controller synthesis for timed systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Qualitative approximate behavior composition
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
The complexity of bounded synthesis for timed control with partial observability
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Automatic behavior composition synthesis
Artificial Intelligence
On the aggregation problem for synthesized Web services
Journal of Computer and System Sciences
Synthesis modulo recursive functions
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Supremal realizability of behaviors with uncontrollable exogenous events
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Synthesis of hierarchical systems
Science of Computer Programming
| Hi-index | 0.00 |
Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is always assumed the system is "constructed from scratch" rather than "composed" from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial system, either in hardware or in software system, relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. In this work we define and study the problem of LTL synthesis from libraries of reusable components. We define two notions of composition: data-flow composition, for which we prove the problem is undecidable, and control-flow composition, for which we prove the problem is 2EXPTIME-complete. As a side benefit we derive an explicit characterization of the information needed by the synthesizer on the underlying components. This characterization can be used as a specification formalism between component providers and integrators.