On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to algorithms
On the complexity of equation solving in process algebra
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
On controllability and normality of discrete event dynamical systems
Systems & Control Letters
Handbook of logic in computer science (vol. 4)
Forward and backward simulations I.: untimed systems
Information and Computation
Communication and Concurrency
Elements of the Theory of Computation
Elements of the Theory of Computation
The Book of Traces
Finite-State Strategies in Regular Infinite Games
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The Supervisor Synthesis Problem for Unrestricted CTL is NP-complete
The Supervisor Synthesis Problem for Unrestricted CTL is NP-complete
Categories of asynchronous systems
Categories of asynchronous systems
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Compositional Abstractions of Hybrid Control Systems
Discrete Event Dynamic Systems
Control of discrete-event systems with modular or distributed structure
Theoretical Computer Science
Discrete Event Dynamic Systems
Model checking LTL over controllable linear systems is decidable
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Logical implementation of uncertain agents
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
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
| Hi-index | 5.23 |
We study the problem of synthesizing controllers for discrete event systems in a branching time framework. We use a class of labelled transition systems to model both plants and specifications. We use first simulations and later bisimulations to capture the role of a controller; the controlled behaviour of the plant should be related via a simulation (bisimulation) to the specification. For both simulations and bisimulations we show that the problem of checking if a pair of finite transition systems - one modelling the plant and the other the specification - admits a controller is decidable in polynomial time. We also show that the size of the controller, if one exists, can be bounded by a polynomial in the sizes of the plant and the specification and can be effectively constructed in polynomial time. Finally, we prove that in the case of simulations, the problem of checking for the existence of a controller is undecidable in a natural concurrent setting.