Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints

Abstract

In this paper a type of specifications called OR-AND Generalized Mutual Exclusion Constraints (GMEC)\ud for place/transition nets is defined. Such a specification consists of a disjunction of conjunction of\ud several single GMECs, i.e., the requirement is that, at any given time, the controlled system should satisfy\ud at least one set of conjunctive GMECs. We show that a bounded OR-AND GMEC can be enforced by\ud a special control structure composed by a set of AND-GMEC monitor places plus a switcher that determines\ud the current active ones. We also show that such a simple control structure can be modified to ensure\ud maximal permissiveness. This approach can be used in the framework of supervisory control in Petri net

Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

“…r that grows exponentially with r and polynomially with s and m. 2 On the contrary, by choosing the basis partition (T E , T I ) such that T E = {t init } and T I = T \{t init }, the corresponding BRG is shown in Figure 4. Here one can see that the number of basis markings is |M| = s + 1, and this number does not depend on r (the number of workflows) and on the structure of the workflows.…”

“…Typically they require solving the marking reachability problem, i.e., determining if a given marking is reachable from the initial one. It plays an important role in Petri net theory since many properties like liveness and deadlock-freeness require the reachability analysis of a system, and many other problems like supervisor design [1], [2], deadlock avoidance [3], [4], and controllability analysis [5], [6], [7] are equivalent or can be reduced to the marking reachability problem.…”

Object-oriented Petri nets and π-calculus-based modeling and analysis of reconfigurable manufacturing systems

“…Petri nets have been widely applied to discrete event systems, supervisory control theory, and the short-term scheduling problem. [18][19][20][21][22][23] The ordinary Petri nets, however, do not address the modeling issues of dynamic structures.…”

An Enhanced Supervisory Control Strategy for Periodicity Mutual Exclusions in Discrete Event Systems Based on Petri Nets

“…The authors in [40] provide a class of generalized mutual exclusion constraints on a class of forward-concurrent-free nets. In [41], a type of specification, called OR-AND generalized mutual exclusion constraints, is defined for place/transition nets. Such a specification consists of a disjunction of conjunction of several single generalized mutual exclusion constraints.…”