BLOCKING AND CONTROLLABILITY OF PETRI NETS IN SUPERVISORY CONTROL

Authors
GIUA A DICESARE F
Citation
A. Giua et F. Dicesare, BLOCKING AND CONTROLLABILITY OF PETRI NETS IN SUPERVISORY CONTROL, IEEE transactions on automatic control, 39(4), 1994, pp. 818-823
Citations number
19
Categorie Soggetti
Controlo Theory & Cybernetics","Robotics & Automatic Control","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on automatic control → ACNP
ISSN journal
00189286
Volume
39
Issue
4
Year of publication
1994
Pages
818 - 823
Database
ISI
SICI code
0018-9286(1994)39:4<818:BACOPN>2.0.ZU;2-5
Abstract
This note discusses the use of Petri net languages in supervisory cont rol theory. First it is shown that the trimming of an unbounded Petri net is not always possible and a new class of Petri net languages, tha t may be generated by nonblocking nets, is defined. Secondly, necessar y and sufficient conditions for the existence of a Petri net superviso r, under the hypothesis that the system's behavior and the legal behav ior are both Petri net languages, are derived. Finally, by means of an example, it is shown that Petri net languages am not closed under the supremal controllable sublanguage operator.