Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
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)
SIAM Journal on Control and Optimization
Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system
Languages, automata, and logic
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
Branching time controllers for discrete event systems
Theoretical Computer Science
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Controllers for Discrete Event Systems via Morphisms
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Fair Realizability and Synthesis
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Strong Cyclic Planning Revisited
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Trading Probability for Fairness
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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
A compositional framework for controller synthesis
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Semi-automatic distributed synthesis
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Discrete Event Dynamic Systems
Behavior based service composition
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
From qualitative to quantitative enforcement of security policy
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
A framework for automatic generation of security controller
Software Testing, Verification & Reliability
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Concurrency control generation for dynamic threads using discrete-event systems
Science of Computer Programming
| Hi-index | 0.00 |
We study the problems of synthesizing open systems as well as controllers for them. The key aspect of our model is that it caters to reactive environments, which can disable different sets of responses when reacting with the system. We deal with specifications given as formulas in CTL* and its sub-logic CTL. We show that both these problems, with specifications in CTL (CTL*), are 2EXPTIME-complete (resp. 3EXPTIME-complete). Thus, in a sense, reactive environments constitute a provably harder setting for the synthesis of open systems and controllers for them.