Mutual exclusion problems for discrete event systems with shared events

C. H. Golaszewski; Peter Jeffrey Ramadge

Mutual exclusion problems for discrete event systems with shared events

C. H. Golaszewski, Peter Jeffrey Ramadge

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	234-239
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
State	Published - Dec 1 1988

All Science Journal Classification (ASJC) codes

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

Cite this

@article{cdfe31a20ebb4637a95573d40c7de33c,

title = "Mutual exclusion problems for discrete event systems with shared events",

abstract = "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.",

author = "Golaszewski, {C. H.} and Ramadge, {Peter Jeffrey}",

year = "1988",

month = dec,

day = "1",

language = "English (US)",

pages = "234--239",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Mutual exclusion problems for discrete event systems with shared events

AU - Golaszewski, C. H.

AU - Ramadge, Peter Jeffrey

PY - 1988/12/1

Y1 - 1988/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024173615&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024173615&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0024173615

SN - 0191-2216

SP - 234

EP - 239

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

ER -

Mutual exclusion problems for discrete event systems with shared events

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this