PSPACE-completeness of modular supervisory control problems

Kurt Rohloff, Stéphane Lafortune

Research output: Contribution to journalReview articlepeer-review

15 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)145-167
Number of pages23
JournalDiscrete Event Dynamic Systems: Theory and Applications
Volume15
Issue number2
DOIs
StatePublished - Jun 2005
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Electrical and Electronic Engineering

Keywords

  • Computational complexity
  • Modular systems
  • Supervisory control
  • Verification

Fingerprint Dive into the research topics of 'PSPACE-completeness of modular supervisory control problems'. Together they form a unique fingerprint.

Cite this