Maximally permissive mutually and globally nonblocking supervisors for discrete event systems
Paper i proceeding, 2004

A supervisor is said to be mutually nonblocking with respect to a pair of specifications if upon completing a task in any of the specifications , it can continue on to complete t he task in the other specificat ion, i.e. , the two specifications do not block each other. T he notion of mutually nonblocking supervisor was introduced by Fabian and Kumar (2000). In this paper we present an algorithm of polynomial complexity for computing a maximally permissive mutually and globally nonblocking supervisor. The algorithm is based on a notion of attmctability, and as a special case offers a new way of computing the maximally permissive nonblocking supervisors.

Supervisory control

Nonblocking

Discrete event systems

Controllability

Mutually nonblocking

Författare

Ratnesh Kumar

Iowa State University

Shigemasa Takai

Wakayama University

Martin Fabian

Chalmers, Signaler och system, System- och reglerteknik, Automation

Toshimitsu Ushio

Osaka University

IFAC Proceedings Volumes (IFAC-PapersOnline)

14746670 (ISSN)

Vol. 37 18 69-74

7th International Workshop on Discrete Event Systems, WODES 2004
Reims, France,

Ämneskategorier

Datavetenskap (datalogi)

Matematisk analys

DOI

10.1016/S1474-6670(17)30724-3

Mer information

Senast uppdaterat

2020-03-23