Mutual exclusion problems for discrete event systems with shared events

C. H. Golaszewski, Peter Jeffrey Ramadge

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


The authors consider coordination problems for partially synchronized processes. They prove that the decidability of the mutual exclusion problem with shared events is not solvable in polynomial time. However, they also show that there is an interesting subclass of discrete-event processes with shared events for which the mutual exclusion problem remains computationally feasible.

Original languageEnglish (US)
Pages (from-to)234-239
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - Dec 1 1988

All Science Journal Classification (ASJC) codes

  • Chemical Health and Safety
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Mutual exclusion problems for discrete event systems with shared events'. Together they form a unique fingerprint.

Cite this