An Optimal Transition Efficiency Maximally Permissive Liveness of FMSs Modeled With S<sup>4</sup>PR Petri Nets

A novel approach is presented to design maximally permissive liveness implementation successfully in the highly efficient Petri Nets (PNs) controller for flexible manufacturing systems. The algorithm stabilizes design control transitions (CTs), which are solutions considered to make PNs able to quickly and automatically prevent all deadlocks with guaranteed live PN. In general, we focus our approach on class PN, namely a system of sequential systems with shared resources (S<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup>PR) that can model intricate FMSs where carrying out a task might call for several different kinds of resources as well as several units of a particular resource. The ability of PN to fully executable a Reachability Graph (RG) in terms of producing efficient procedures for the preservation of all FMS resource activity is under the influence of CTs. In particular, we aim to guarantee that promoting liveness in PN verification will achieve the maximally permissive supervisor RG in an optimal PN manner. Three examples show that PNs with modeled FMS are significantly more efficient and require simulation and control FMS.

Authors

Institutions

Publication Details

Published
2025-03-07
DOI
https://doi.org/10.1109/csnt64827.2025.10968295
Citations
5
Primary Topic
Petri Nets in System Modeling
Type
article
Field-Weighted Citation Impact
7.52
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Optimal Transition Efficiency Maximally Permissive Liveness of FMSs Modeled With S4PR Petri Nets

Mowafak Hassan Abdul-Hussin
5 citations
Petri Nets in System Modeling
7.52
article

An Optimal Transition Efficiency Maximally Permissive Liveness of FMSs Modeled With S4PR Petri Nets

Mowafak Hassan Abdul-Hussin
article en
5 citations

Abstract

A novel approach is presented to design maximally permissive liveness implementation successfully in the highly efficient Petri Nets (PNs) controller for flexible manufacturing systems. The algorithm stabilizes design control transitions (CTs), which are solutions considered to make PNs able to quickly and automatically prevent all deadlocks with guaranteed live PN. In general, we focus our approach on class PN, namely a system of sequential systems with shared resources (S<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup>PR) that can model intricate FMSs where carrying out a task might call for several different kinds of resources as well as several units of a particular resource. The ability of PN to fully executable a Reachability Graph (RG) in terms of producing efficient procedures for the preservation of all FMS resource activity is under the influence of CTs. In particular, we aim to guarantee that promoting liveness in PN verification will achieve the maximally permissive supervisor RG in an optimal PN manner. Three examples show that PNs with modeled FMS are significantly more efficient and require simulation and control FMS.

University of Technology - Iraq (IQ)
Climate action
Openalex Percentile: Top 3%
Petri Nets in System Modeling
7.52
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.