Branching time controllers for discrete event systems

Theoretical Computer Science

Volumn 274, Issue 1-2, 2002, Pages 117-149

  Madhusudan, P ^a   Thiagarajan, P S ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

Asynchronous transition systems; Bisimulations; Controller synthesis; Discrete event systems; Simulations; Supervisor synthesis

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

ASYNCHRONOUS TRANSITION SYSTEMS; BRANCHING TIME CONTROLLERS;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0037028854     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00307-8     Document Type: Conference Paper

References (33)

1. Symbolic controller synthesis for discrete and timed systems
2. Using bisimulation to solve discrete event control problems
3. Solving sequential conditions by finite-state strategies
4. Logic, arithmetic and automata
5. On the complexity of equation solving in process algebra
6. Bisimulation and open maps
7. Hereditary history preserving bisimilarity is undecidable
8. CCS expressions, finite state processes, and three problems of equivalence
9. On controllability and normality of discrete event dynamical systems
10. Centralized and decentralized supervisory control of nondeterministic systems under partial observation
11. Module checking
12. Module checking revisited
13. Equation solving using modal transition systems
14. Forward and backward simulations
15. Operational and algebraic semantics of concurrent processes
16. Supervisory control for nondeterministic systems
17. Supervisory control using failure semantics and partial specifications
18. On the synthesis of a reactive module
19. Distributed reactive systems are hard to synthesize
20. The control of discrete event systems
21. Finite strategies in regular infinite games
22. Models for concurrency
23. Modular control and coordination of discrete-event systems