Authors:
Ramavarapu S. Sreenivas,
Volume: 1, Page 2651 Paper number 1711
Abstract:
A Petri Net (PN) is said to be live if it is possible to fire any transition
from every reachable marking, although not necessarily immediately.
Under appropriate conditions, a non-live PN can be made live via supervision.
Under this paradigm an external-agent, the supervisor, prevents the
firing of certain transitions at each reachable marking so as to enforce
liveness. A PN is partially controlled if the supervisor can prevent
the firing of only a subset of transitions. A Free Choice Petri net
(FCPN) is a PN where every arc from a place to a transition is either
the unique output arc from that place, or, it is the unique input arc
to the transition. In this paper we show for each partially controlled
FCPN that can be made live via supervision, any marking that is reachable
under a policy that enforces liveness should cover (with respect to
the standard partial ordering of vectors) a member of a specific, finite
set of minimal-markings. Assuming this set is readily available, this
observation is used to (i) test the existence, and (ii) to synthesize
a minimally restrictive supervisory policy that enforces liveness in
a partially controllable FCPN. We suggest investigations into the
computation of this specific, finite set of minimal markings as a future
research topic.
Authors:
Kevin X. He,
Michael D. Lemmon,
Volume: 1, Page 2657 Paper number 1795
Abstract:
A marking-based Petri net supervisor restricts a Petri net's behavior
by disabling controllable transitions. Monitors are control places
that enforce generalized mutual exclusion constraints. A long standing
question concerns the relationship between marking-based supervisors
and monitors. There are necessary and sufficient conditions for the
existence of maximally permissive marking based supervisors enforcing
liveness, but associated monitor solutions may not be maximally permissive.
This paper proves that for a bounded Petri net, a maximally permissive
liveness enforcing marking based supervisor can always be transformed
into a monitor supervisor. Specific conditions are identified that
characterize when the resulting monitor supervisor will or will not
be maximally permissive. Several examples are used to illustrate these
results.
Authors:
Jonghun Park,
Spyros A. Reveliotis,
Volume: 1, Page 2663 Paper number 1772
Abstract:
The need for effective and efficient deadlock avoidance policies (DAP's)
is ever increasing due to the higher demand for system automation.
This paper considers the deadlock avoidance problem for the class
of Conjunctive/Disjunctive (sequential) resource allocation systems
(C/D-RAS), in which multiple resource acquisitions and flexible routings
are allowed. A new siphon-based characterization of deadlocks arising
in C/D-RAS is developed, and subsequently, this characterization facilitates
the development of a polynomial complexity deadlock avoidance policy
for the considered RAS class. The developed policy can be perceived
as a generalization of RUN DAP, originally developed for sequential
RAS with unit resource allocations and no routing flexibility. The
proposed approach is demonstrated by an example.
Authors:
Dimitri Lefebvre,
Volume: 1, Page 2670 Paper number 1042
Abstract:
Production frequencies provide useful information for analysis and
faults diagnosis of manufacturing systems. However, such frequencies
are not always measurable. In this case they can be estimated from
the observation of other variables. This work deals with the production
frequencies estimation for systems that are modelled by continuous
Petri nets. The buffers contents are measured on-line and the production
frequencies estimation results from the inversion of the Petri net
model. The exact and approximated solutions of the estimation problem
are described. Accuracy of the estimation is related to the measurement
error and to the Petri net structure. When the estimation provides
several solutions, results are proposed to complete the Petri net such
that a unique solution is obtained.
Authors:
Alessandro Giua,
Carla Seatzu,
Volume: 1, Page 2676 Paper number 2180
Abstract:
In this paper we discuss the problem of estimating the marking of a
Place/Transition net based on event observation. We assume that the
net structure is known while the initial marking is unknown. We define
several observability properties and show how they can be proved. In
particular we set up a hierarchy considering the possibility that the
above properties are satisfied by a net N starting from an initial
marking M_0, by a net N starting from any initial marking M reachable
from an initial marking M_0, or by a net N starting from any marking
in N^m, where m is the number of places of the net.
Authors:
Young Cheol Cho,
Wook Hyun Kwon,
Volume: 1, Page 2682 Paper number 1911
Abstract:
A state avoidance controller with inhibitor arcs called ``IA-controller"
is proposed for non-convex forbidden state problems in Petri nets.
The forbidden condition is transformed into non-convex marking constraints
in controlled PNs. Simple formulas for IA-controllers are developed
to avoid the non-convex marking condition. By extending enabling rule
of controllable transitions, the IA-controller can realize OR-logics,
which is impossible in ordinary PN structure-type controllers. The
significance of IA-controller is that the controller can be easily
implemented in the plant model. In addition, IA-controllers are synthesized
in a modular way in order to solve multiple forbidden conditions.
|