PSPACE-completeness of modular supervisory control problems
From MaRDI portal
Publication:1773103
DOI10.1007/s10626-004-6210-5zbMath1059.93092OpenAlexW2029944742MaRDI QIDQ1773103
Stéphane Lafortune, Kurt R. Rohloff
Publication date: 25 April 2005
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-004-6210-5
Hierarchical systems (93A13) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Verification complexity of a class of observational properties for modular discrete events systems, Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication, A new method for centralised and modular supervisory control of real-time discrete event systems, Complexity of detectability, opacity and A-diagnosability for modular discrete event systems, Active fault tolerant control of discrete event systems using online diagnostics, Distributed computation of supremal conditionally controllable sublanguages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharing out control in distributed processes
- On observability of discrete-event systems
- Modular supervisory control of discrete-event systems
- Modular control and coordination of discrete-event systems
- Reasoning about infinite computations
- Fairness and control in multi-agent systems
- A general architecture for decentralized supervisory control of discrete-event systems
- Decentralized supervisory control of discrete-event systems
- On the complexity of verifying concurrent transition systems
- Discrete-time control for rectangular hybrid automata
- Relationships between nondeterministic and deterministic tape complexities
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- Know means no: Incorporating knowledge into discrete-event control systems
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
- Supervisory control of concurrent discrete-event systems
- Think globally, act locally: decentralized supervisory control
- The computational complexity of decentralized discrete-event control problems
- Deciding co-observability is pspace-complete
- On the synthesis of safe control policies in decentralized control of discrete-event systems
- Hierarchical interface-based supervisory Control-part I: serial case
- An automata-theoretic approach to branching-time model checking
- A survey of computational complexity results in systems and control
