A Class of Well Structured Petri Nets for Flexible Manufacturing Systems

Ezpeleta, J.; García-Vallés, F.; Colom, José Manuel

doi:10.1007/3-540-69108-1_5

Cited by 47 publications

(26 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth noting that Definition 3 collapses with the definition of acceptable initial markings respectively provided for those subclasses [4,5,22]. Besides, there exists another class for Sequential RAS, called SPQR [16], which does not strictly contain or is contained by the PC 2 R class.…”

Section: Definition 2 Let I N Be a Finite Set Of Indices A Pcmentioning

confidence: 95%

A Petri Net Perspective on the Resource Allocation Problem in Software Engineering

López-Grao

Colom

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Resource Allocation Systems (RAS) were intensively studied in the last years for Flexible Manufacturing Systems (FMS). The success of this research stems from the identification of subclasses of Petri Nets that correspond to an RAS abstraction of these systems. In this paper we take a parallel road to that travelled through for FMS, but for the case of software applications. These applications present concurrency, and deadlocks can happen due to the allocation of shared resources. We reveal that the existing subclasses of Petri Nets used to study this kind of deadlock problems are insufficient, even for very simple software systems. We propose a new subclass of Petri Nets that generalizes the previously known RAS subclasses and we present a taxonomy of anomalies that can be found in the context of software systems.

show abstract

Section: Definition 2 Let I N Be a Finite Set Of Indices A Pcmentioning

confidence: 95%

A Petri Net Perspective on the Resource Allocation Problem in Software Engineering

López-Grao

Colom

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…those whose structure is a linear S 3 PR, that is, LS 3 PR [36], and those whose structure is a general S 3 PR. Note that an LS 3 PR (linear system of simple sequential processes with resources), strictly speaking, is not an extended but a restrictive version of an S 3 PR.…”

Section: A Multistep Look-aheadmentioning

confidence: 99%

“…For economy of space, the definition of an LS 3 PR is not presented here. For details, one can refer to the work in [36]. Some examples and experimental results are provided to illustrate the laws.…”

Section: A Multistep Look-aheadmentioning

confidence: 99%

A Multistep Look-Ahead Deadlock Avoidance Policy for Automated Manufacturing Systems

Al-Ahmari

2017

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

For an automated manufacturing system (AMS), it is a computationally intractable problem to find a maximally permissive deadlock avoidance policy (DAP) in a general case, since the decision on the safety of a reachable state is NP-hard. This paper focuses on the deadlock avoidance problem for systems of simple sequential processes with resources (S 3 PR) by using Petri nets structural analysis theory. Inspired by the one-step look-ahead DAP that is an established result, which is of polynomial complexity, for an S 3 PR without one-unit-capacity resources shared by two or more resource-transition circuits (in the Petri net model) that do not include each other, this research explores a multiple-step look-ahead deadlock avoidance policy for a system modeled with an S 3 PR that contains a shared one-unit-capacity resource in resource-transition circuits. It is shown that the development of an optimal DAP for the considered class of Petri nets is also of polynomial complexity. It is indicated that the steps needed to look ahead in a DAP depend on the structure of the net model. A number of examples are used to illustrate the proposed method.

show abstract

“…It is only suitable for ordinary Petri nets (OPNs). In addition, since a PN system that models a practical FMS, such as S 2 PR (a simple sequential process with resources), S 3 PR (systems of simple sequential processes with resources) (Ezpeleta et al 1995), L-S 3 PR (Linear S 3 PR) (Ezpeleta et al 1998), ES 3 PR (Extended S 3 PR) (Huang et al 2006), and S 4 R (a system of sequential systems with shared resources) (Li and Zhou 2009), is self-loop free and contains one or more strongly connected state machines, the number of places in the PN is at least two. As a result, the new added constraint P p2P p 5 jPj (jPj denotes the total number of places in a Petri net) is not accurate to solve the revised MIP problem of Chao (2009).…”

Section: Introductionmentioning

confidence: 99%

Solving siphons with the minimal cardinality in Petri nets and its applications to deadlock control

Li¹,

Li²

2012

International Journal of Production Research

View full text Add to dashboard Cite

Siphons can be used to characterise deadlock states and solve deadlock problems in Petri nets that model flexible manufacturing systems. By modifying the objective function and adding new constraints to the mixedinteger programming (MIP) method proposed by Park and Reveliotis, this paper presents a revised MIP (RMIP) to directly solve siphons, called smart siphons, with the minimal cardinality as well as the minimal number of resource places. Accordingly, an iterative siphon-based control (ISC) method adds a proper control place (CP) to make each smart siphon max-controlled until the controlled system is live. Since any siphon that has more resource places can be composed of those containing less resource places, a small number of CPs are required during the iterative control process due to the solved smart siphons containing the minimal number of resource places. Compared with the existing methods in the literature, the proposed ISC method using the RMIP avoids computing a maximal deadly marked siphon from which a minimal siphon is then derived, adds a small number of proper CPs, and leads to a liveness-enforcing supervisor with a simple structure. Finally, a case study demonstrates the effectiveness of the proposed ISC method.

show abstract

A Class of Well Structured Petri Nets for Flexible Manufacturing Systems

Cited by 47 publications

References 16 publications

A Petri Net Perspective on the Resource Allocation Problem in Software Engineering

A Petri Net Perspective on the Resource Allocation Problem in Software Engineering

A Multistep Look-Ahead Deadlock Avoidance Policy for Automated Manufacturing Systems

Solving siphons with the minimal cardinality in Petri nets and its applications to deadlock control

Contact Info

Product

Resources

About