Sökning: id:"swepub:oai:research.chalmers.se:67a41ac5-7bf0-4485-8837-f5f5c4a8e8aa" >
Maximally permissiv...
Maximally permissive mutually and globally nonblocking supervisors for discrete event systems
-
- Kumar, Ratnesh (författare)
- Iowa State University
-
- Takai, Shigemasa (författare)
- Wakayama University
-
- Fabian, Martin, 1960 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
visa fler...
-
- Ushio, Toshimitsu (författare)
- Osaka University
-
visa färre...
-
(creator_code:org_t)
- 2004
- 2004
- Engelska.
-
Ingår i: IFAC Proceedings Volumes (IFAC-PapersOnline). - 2405-8963. ; 37:18, s. 69-74
- Relaterad länk:
-
https://research.cha...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Matematik -- Matematisk analys (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Mathematical Analysis (hsv//eng)
Nyckelord
- Supervisory control
- Nonblocking
- Discrete event systems
- Controllability
- Mutually nonblocking
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas