PSPACE-completeness of modular supervisory control problems
From MaRDI portal
Publication:1773103
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)
Recommendations
Cites work
- A general architecture for decentralized supervisory control of discrete-event systems
- A survey of computational complexity results in systems and control
- An automata-theoretic approach to branching-time model checking
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- Decentralized supervisory control of discrete-event systems
- Deciding co-observability is pspace-complete
- Discrete-time control for rectangular hybrid automata
- Fairness and control in multi-agent systems
- Hierarchical interface-based supervisory Control-part I: serial case
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 149060 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1332671 (Why is no real title available?)
- scientific article; zbMATH DE number 1754607 (Why is no real title available?)
- scientific article; zbMATH DE number 1383199 (Why is no real title available?)
- scientific article; zbMATH DE number 1836359 (Why is no real title available?)
- scientific article; zbMATH DE number 1836362 (Why is no real title available?)
- Know means no: Incorporating knowledge into discrete-event control systems
- Modular control and coordination of discrete-event systems
- Modular supervisory control of discrete-event systems
- On observability of discrete-event systems
- On the complexity of verifying concurrent transition systems
- On the synthesis of safe control policies in decentralized control of discrete-event systems
- Reasoning about infinite computations
- Relationships between nondeterministic and deterministic tape complexities
- Sharing out control in distributed processes
- Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of concurrent discrete-event systems
- Supervisory control of discrete-event processes with partial observations
- The computational complexity of decentralized discrete-event control problems
- Think globally, act locally: decentralized supervisory control
Cited in
(7)- 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
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Distributed computation of supremal conditionally controllable sublanguages
- A new method for centralised and modular supervisory control of real-time discrete event systems
- Active fault tolerant control of discrete event systems using online diagnostics
- Everything Is PSPACE-Complete in Interaction Systems
This page was built for publication: PSPACE-completeness of modular supervisory control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773103)
