Learning branches and learning to win closed games
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Software engineering education: Rôles of formal specification and design calculi
Annals of Software Engineering - Special issue on software engineering education
The Control of Synchronous Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Automatic synthesis of a subclass of schedulers in timed systems
Theoretical Computer Science - Australasian computer science
Combining supervisor synthesis and model checking
ACM Transactions on Embedded Computing Systems (TECS)
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
State estimation and detectability of probabilistic discrete event systems
Automatica (Journal of IFAC)
Supervisory control of discrete event systems
Mathematical and Computer Modelling: An International Journal
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
| Hi-index | 0.00 |
A problem in the control of automata on infinite strings is defined and analyzed. The key to the investigation is the development of a fixpoint characterization of the "controllability subset" of a deterministic Rabin automaton, the set of states from which the automaton can be controlled to the satisfaction of its own acceptance condition. The fixpoint representation allows straightforward computation of the controllability subset and the construction of a suitable state-feedback control for the automaton. The results have applications to control synthesis, automaton synthesis, and decision procedures for logical satisfiability; in particular, they represent a direct, efficient and natural solution to Church's problem, the construction of winning strategies for two-player zero-sum $\omega$-regular games of perfect information, and the emptiness problem for automata on infinite trees.