Sharing out control in distributed processes
Theoretical Computer Science
Fairness and control in multi-agent systems
Theoretical Computer Science
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
On the complexity of verifying concurrent transition systems
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Emptiness Problem for Intersections of Regular Languages
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Synthesizing Distributed Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
On the complexity of supervisory control design in the RW framework
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
In this paper we investigate computational issues associated with the supervision of concurrent processes modeled as modular discrete-event systems. Here, modular discrete-event systems are sets of deterministic finite-state automata whose interaction is modeled by the parallel composition operation. Even with such a simple model process model, we show that in general many problems related to the supervision of these systems are PSPACE-complete. This shows that although there may be space-efficient methods for avoiding the state-explosion problem inherent to concurrent processes, there are most likely no time-efficient solutions that would aid in the study of such "large-scale" systems. We show our results using a reduction from a special class of automata intersection problem introduced here where behavior is assumed to be prefix-closed. We find that deciding if there exists a supervisor for a modular system to achieve a global specification is PSPACE-complete. We also show many verification problems for system supervision are PSPACE-complete, even for prefix-closed cases. Supervisor admissibility and online supervision operations are also discussed.