Alternating automata on infinite trees
Theoretical Computer Science
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the development of reactive systems
Logics and models of concurrent systems
Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation - Special issue on FLOC '96
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Framework for Component-based Construction Extended Abstract
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Notion of Glue Expressiveness for Component-Based Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Synthesis from Component Libraries
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Automatic synthesis of new behaviors from a library of available behaviors
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Synthesising Features by Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Methods in System Design
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
Unbeast: symbolic bounded synthesis
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
Improved model checking of hierarchical systems
Information and Computation
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On-the-Fly reachability and cycle detection for recursive state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Synthesis of reactive(1) designs
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Acacia+, a tool for LTL synthesis
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Pushdown module checking with imperfect information
Information and Computation
Automatic behavior composition synthesis
Artificial Intelligence
Hi-index | 0.00 |
In automated synthesis, given a specification, we automatically create a system that is guaranteed to satisfy the specification. In the classical temporal synthesis algorithms, one usually creates a ''flat'' system ''from scratch''. However, real-life software and hardware systems are usually created using preexisting libraries of reusable components, and are not ''flat'' since repeated sub-systems are described only once. In this work we describe an algorithm for the synthesis of a hierarchical system from a library of hierarchical components, which follows the ''bottom-up'' approach to system design. Our algorithm works by synthesizing in many rounds, when at each round the system designer provides the specification of the currently desired module, which is then automatically synthesized using the initial library and the previously constructed modules. To ensure that the synthesized module actually takes advantage of the available high-level modules, we guide the algorithm by enforcing certain modularity criteria. We show that the synthesis of a hierarchical system from a library of hierarchical components is Exptime-complete for @m-calculus, and 2Exptime-complete for Ltl, both in the cases of complete and incomplete information. Thus, in all cases, it is not harder than the classical synthesis problem (of synthesizing flat systems ''from scratch''), even though the synthesized hierarchical system may be exponentially smaller than a flat one.