The computational complexity of decentralized discrete-event control problems
From MaRDI portal
Publication:4850272
DOI10.1109/9.400469zbMath0833.93007OpenAlexW2150052960MaRDI QIDQ4850272
Publication date: 9 October 1995
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: http://purl.umn.edu/2374
Related Items
Approximating the minimal sensor selection for supervisory control, Solvability of centralized supervisory control under partial observation, Undecidable problems of decentralized observation and control on regular languages, Decentralized supervisory control of discrete event systems with communication delays based on conjunctive and permissive decision structures, Formulae relating controllability, observability, and co-observability, Decentralized diagnosis of fuzzy discrete-event systems, Codiagnosability and coobservability under dynamic observations: transformation and verification, Mind the gap: expanding communication options in decentralized discrete-event control, A survey of computational complexity results in systems and control, Reliable Decentralized Supervisors for Discrete‐Event Systems Under Communication Delays: Existence and Verification, PSPACE-completeness of modular supervisory control problems, Reliable supervisory control for general architecture of decentralized discrete event systems, Undecidability in decentralized supervision, Logical models of discrete even systems: a comparative exposition, Control design for autonomous vehicles: a dynamic optimization perspective, On the minimization of communication in networked systems with a central station, A Summary of Some Discrete-Event System Control Problems, Relative coobservability for decentralised supervisory control of discrete-event systems, Supervisory Control with Partial Observations
