Boolean coordination problems for product discrete event systems

C. H. Golaszewski, P. J. Ramadge

Research output: Contribution to journalConference article

1 Scopus citations

Abstract

A general coordination problem is formulated for discrete event systems with concurrent operation modeled by the synchronous product of controllable generators. This problem requires that the invariance of a Boolean predicated on the state set be maintained by appropriate choice of control actions. Necessary and sufficient conditions for the existence of a coordinator which guarantees that the supervised system satisfies the Boolean predicate are presented. The computational tractability of two commonly encountered representations for coordination constraints specified by Boolean predicates (conjunctions of elementary disjunctions and hyperplanes) are investigated. It is shown that restricted instances of these problems can be solved in a time bounded by a polynomial in the input size.

Original languageEnglish (US)
Pages (from-to)3428-3433
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume6
DOIs
StatePublished - Jan 1 1990
Externally publishedYes
EventProceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6) - Honolulu, HI, USA
Duration: Dec 5 1990Dec 7 1990

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Boolean coordination problems for product discrete event systems'. Together they form a unique fingerprint.

  • Cite this