Mutual exclusion problems for discrete event systems with shared events

Author

Golaszewski, C.H. ; Ramadge, P.J.

Author_Institution

Dept. of Electr. Eng., Princeton Univ., NJ, USA

fYear

1988

fDate

7-9 Dec 1988

Firstpage

234

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

Keywords

automata theory; concurrency control; decidability; automata theory; concurrency control; coordination problems; decidability; discrete event systems; mutual exclusion problem; partially synchronized processes; shared events; Artificial intelligence; Automata; Automatic control; Computational complexity; Concurrent computing; Discrete event systems; Mutual coupling; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1988., Proceedings of the 27th IEEE Conference on

Conference_Location

Austin, TX

Type

conf

DOI

10.1109/CDC.1988.194301

Filename

194301

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2970501