Deciding co-observability is pspace-complete

DOI10.1109/TAC.2003.819285MaRDI QIDQ5266687zbMATH OpenFDO

Authors Kurt R. Rohloff, Tae-Sic Yoo, Stéphane Lafortune

Publication date 20 June 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete event control/observation systems (93C65)

Cited in

(4)

• Verification complexity of a class of observational properties for modular discrete events systems
• PSPACE-completeness of modular supervisory control problems
• Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication
• Diagnosis of discrete event systems using decentralized architectures

This page was built for publication: Deciding co-observability is pspace-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266687)