Parallel and sequential mutual exclusions for petri net modeling of manufacturing systems with shared resources
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 7 (4) , 515-527
- https://doi.org/10.1109/70.86081
Abstract
A theoretical basis for Petri net synthesis methods is provided that can be used to model systems with shared resources, and to make the resulting nets bounded, live, and reversible. Two resource-sharing concepts, parallel mutual exclusion (PME) and sequential mutual exclusion (SME), are formulated in the context of the Petri net theory. A PME models a resource shared by distinct independent processes, and an SME is a sequential composition of PMEs, modeling a resource shared by sequentially related processes. The conditions under which a net containing such structures remains bounded, live, and reversible are derivedKeywords
This publication has 23 references indexed in Scilit:
- Petri net modeling of a flexible assembly station for printed circuit boardsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Modeling buffers in automated manufacturing systems using Petri netsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Petri net design method for automated manufacturing systems with shared resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adaptive design of Petri net controllers for error recovery in automated manufacturing systemsIEEE Transactions on Systems, Man, and Cybernetics, 1989
- Modular synthesis of deadlock-free control structuresPublished by Springer Nature ,1986
- Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri netsInformation Processing Letters, 1985
- Hierarchical reduction method for analysis and decomposition of Petri netsIEEE Transactions on Systems, Man, and Cybernetics, 1985
- Additional methods for reduction and expansion of marked graphsIEEE Transactions on Circuits and Systems, 1981
- Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and PerformanceIEEE Transactions on Software Engineering, 1980
- Reduction and expansion of live and safe marked graphsIEEE Transactions on Circuits and Systems, 1980