DECIDABILITY AND CLOSURE-PROPERTIES OF WEAK PETRI-NET LANGUAGES IN SUPERVISORY CONTROL

Authors
GIUA A DICESARE F
Citation
A. Giua et F. Dicesare, DECIDABILITY AND CLOSURE-PROPERTIES OF WEAK PETRI-NET LANGUAGES IN SUPERVISORY CONTROL, IEEE transactions on automatic control, 40(5), 1995, pp. 906-910
Citations number
16
Categorie Soggetti
Controlo Theory & Cybernetics","Robotics & Automatic Control","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on automatic control → ACNP
ISSN journal
00189286
Volume
40
Issue
5
Year of publication
1995
Pages
906 - 910
Database
ISI
SICI code
0018-9286(1995)40:5<906:DACOWP>2.0.ZU;2-X
Abstract
We extend the class of control problems that can be modeled by Petri n ets considering the notion of weak terminal behavior. Deterministic we ak languages represent closed-loop terminal behaviors that may be enfo rced by nonblocking Petri net supervisors if controllable. The class o f deterministic weak PN languages is not closed under the supremal con trollable sublanguage operator.