A survey of Petri net methods for controlled discrete event systems
This paper surveys recent research on the application of Petri net models to the analysis and
synthesis of controllers for discrete event systems. Petri nets have been used extensively in …
synthesis of controllers for discrete event systems. Petri nets have been used extensively in …
Controlled Petri nets: A tutorial survey
This paper surveys recent research on the synthesis of controllers for discrete event systems
(DESs) modeled by controlled Petri nets (CtlPNs). Petri nets have been used extensively in …
(DESs) modeled by controlled Petri nets (CtlPNs). Petri nets have been used extensively in …
Blocking and controllability of Petri nets in supervisory control
A Giua, F DiCesare - IEEE Transactions on automatic control, 1994 - ieeexplore.ieee.org
This note discusses the use of Petri net languages in supervisory control theory. First it is
shown that the trimming of an unbounded Petri net is not always possible and a new class of …
shown that the trimming of an unbounded Petri net is not always possible and a new class of …
Supervisory control of deterministic Petri nets with regular specification languages
Algorithms for computing a minimally restrictive control in the context of supervisory control
of discrete-event systems have been well developed when both the plant and the desired …
of discrete-event systems have been well developed when both the plant and the desired …
[CARTE][B] Symbolic methods and tools for discrete event dynamic systems
J Gunnarsson - 1997 - rt.isy.liu.se
Abstract The interest in Discrete Event Dynamic Systems (DEDS) has increased during the
last years, due to the lack of methods and tools that are capable of handling the complexity …
last years, due to the lack of methods and tools that are capable of handling the complexity …
Decidability and closure properties of weak Petri net languages in supervisory control
A Giua, F DiCesare - IEEE transactions on automatic control, 1995 - ieeexplore.ieee.org
We extend the class of control problems that can be modeled by Petri nets considering the
notion of weak terminal behavior. Deterministic weak languages represent closed-loop …
notion of weak terminal behavior. Deterministic weak languages represent closed-loop …
Petri net languages and infinite subsets of Nm
Families of Petri net languages are usually defined by varying the type of transition labeling
and the class of subsets of N m to be used as sets of final markings (m is the number of …
and the class of subsets of N m to be used as sets of final markings (m is the number of …
On a weaker notion of controllability of a language K with respect to a language L
RS Sreenivas - IEEE Transactions on Automatic Control, 1993 - ieeexplore.ieee.org
A necessary and sufficient condition for a prefix-closed language K contained in Sigma* to
be controllable with respect to another prefix-closed language L contained in Sigma* is that …
be controllable with respect to another prefix-closed language L contained in Sigma* is that …
On computation of state avoidance control for infinite state systems in assignment program framework
We study supervisory control of discrete event systems with potentially infinite state-space
using state variables for representation and specification. An assignment program model …
using state variables for representation and specification. An assignment program model …
Supervisory control of Petri net languages
The authors study the supervisory control problem in the setting of Petri net languages. They
show that the problem of determining controllability for Petri net languages is reducible to …
show that the problem of determining controllability for Petri net languages is reducible to …