Document Zbl 1198.90162

On deadlock control for a class of generalised Petri net models of flexible manufacturing systems. (English) Zbl 1198.90162

Int. J. Prod. Res. 47, No. 21, 6085-6107 (2009).

Summary: This paper develops a deadlock prevention policy for a class of Petri nets that can model flexible manufacturing systems with assembly and disassembly operations. Siphons in a plant Petri net model are divided into elementary and dependent siphons according to the linear dependency of their characteristic \(T\)-vectors. The proposed approach is to make every siphon satisfy the controlled-siphon property (the cs-property), i.e., at any reachable marking, any siphon is max-marked, so that no deadlock states can be reached. The satisfiability of the cs-property is achieved by explicitly adding a monitor for each elementary siphon. The max-controllability of a dependent siphon is ensured by properly supervising its elementary siphons. More permissive behaviour of the non-blocking supervisor is obtained through the rearrangement of the output arcs of the monitors. Compared with existing policies reported in the literature, the advantage of the present method is that a small number of monitors are added and the iterative computing process is accordingly avoided. Finally, the application of the proposed method to an FMS example is presented.

Cited in 3 Documents

MSC:

90B30	Production models
68T05	Learning and adaptive systems in artificial intelligence

Keywords:

Petri net; flexible manufacturing system; non-blocking; deadlock prevention; elementary siphon

Software:

INA

Cite Review PDF

Full Text: DOI

References:

[1]	DOI: 10.1007/BF01438223 · doi:10.1007/BF01438223
[2]	DOI: 10.1109/70.63273 · doi:10.1109/70.63273
[3]	Barkaoui, K and Pradat-Peyre, JF. 1996. On liveness and controlled siphons in Petri nets.Proceedings of the 17th international conference on application and theory of Petri nets. 1996, Osaka, Japan. pp.57–72. New York: Springer.
[4]	Barkaoui, K, Chaoui, A and Zouari, B. 1997. Supervisory control of discrete event systems based on structure theory of Petri nets.Proceedings of the IEEE international conference on systems,man and cybernetics. 1997, Orlando, Florida. pp.3750–3755.
[5]	DOI: 10.1109/70.650158 · doi:10.1109/70.650158
[6]	DOI: 10.1109/70.370500 · doi:10.1109/70.370500
[7]	Ezpeleta, J, García-Vallés, F and Colom, JM. 1998. A class of well structured Petri nets for flexible manufacturing systems. Proceedings of the 19th international conference on application and theory of Petri nets. 1998, Lisbon, Portugal. Edited by: Desel, J and Silva, M. pp.64–83. Berlin: Springer.
[8]	DOI: 10.1109/TSMCA.2003.820575 · doi:10.1109/TSMCA.2003.820575
[9]	García-Vallés, F and Colom, JM. 1999. Implicit places in net systems.Proceedings of the 8th international workshop on Petri nets and performance models. 1999, Zaragoza, Spain. pp.104–113.
[10]	DOI: 10.1109/TRA.2002.807555 · doi:10.1109/TRA.2002.807555
[11]	DOI: 10.1109/70.282544 · doi:10.1109/70.282544
[12]	DOI: 10.1080/00207540010002405 · Zbl 1017.90507 · doi:10.1080/00207540010002405
[13]	Huang, YS. 2001b. A deadlock prevention Policy for flexible manufacturing systems using siphons.Proceedings of the IEEE international conference on robotics and automation. 2001b, Seoul, Korea. pp.541–546.
[14]	DOI: 10.1109/3468.769759 · doi:10.1109/3468.769759
[15]	DOI: 10.1109/TRA.2002.805655 · doi:10.1109/TRA.2002.805655
[16]	DOI: 10.1109/TSMCA.2003.820579 · doi:10.1109/TSMCA.2003.820579
[17]	DOI: 10.1080/00207549408957073 · Zbl 0902.90082 · doi:10.1080/00207549408957073
[18]	DOI: 10.1109/TSMCA.2003.820576 · doi:10.1109/TSMCA.2003.820576
[19]	DOI: 10.1109/TSMCA.2006.878966 · doi:10.1109/TSMCA.2006.878966
[20]	DOI: 10.1109/TII.2006.885185 · doi:10.1109/TII.2006.885185
[21]	Murata, T. 1989. Petri nets: properties, analysis, and applications. Proceedings IEEE. 1989. Vol. 77, pp.541–580.
[22]	DOI: 10.1109/9.956052 · Zbl 1045.93034 · doi:10.1109/9.956052
[23]	Reveliotis, SA. On the siphon-based characterization of liveness in sequential resource allocation systems. Proceedings of the international conference on the application and theory of Petri nets. Edited by: van der Aalst, WMP and Best, E. pp.241–255. Berlin: Springer.
[24]	Starke PH, INA: integrated net analyzer (1992)
[25]	Tricas, F and Martinez, J. 1995. An extension of the liveness theory for concurrent sequential processes competing for shared resources.Proceedings of the IEEE international conference on Systems,Man and Cybernetics. 1995, Vancouver, BC. pp.3035–3040. Canada
[26]	Tricas, F. 2000. An iterative method for deadlock prevention in FMSs. R. Boel and G. Stremersch, eds.Proceedings of the5th workshop on discrete event systems. 2000, Ghent, Belgium. pp.139–148. · Zbl 1050.68108
[27]	Uzam M, International Journal of Advances in Manufacturing Technology 19 pp 192– (2002)
[28]	Uzam, M and Zhou, MC. 2004. Iterative synthesis of Petri net based deadlock prevention policy for flexible manufacturing systems.Proceedings of the IEEE international conference on systems,man and cybernetics. 2004, The Hague, The Netherlands. pp.4260–4265.
[29]	DOI: 10.1109/70.63257 · doi:10.1109/70.63257
[30]	DOI: 10.1109/70.105378 · doi:10.1109/70.105378
[31]	DOI: 10.1109/70.781975 · doi:10.1109/70.781975
[32]	DOI: 10.1109/9.481550 · Zbl 0845.90067 · doi:10.1109/9.481550
[33]	DOI: 10.1007/978-1-4615-3126-5 · doi:10.1007/978-1-4615-3126-5
[34]	Zhou MC, Modelling, simulation and control of flexible manufacturing systems: a Petri net approach (1998)
[35]	Zouari, B and Barkaoui, K. 2003. Parameterized supervisor synthesis for a modular class of discrete event systems.Proceedings of the IEEE international conference on systems,man and cybernetics. 2003, Washington, DC. 1874–1879.

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.