Abstract
Petri nets are widely used to model and analyse concurrent systems. There exist two distinct classes of Petri nets that focus on different features of concurrent systems. The first one features multiple parallel processes sharing a group of common resources but not interacting/collaborating with each other. The second one allows multiple parallel processes to interact/collaborate with each other via message exchange but does not share any common resources. However, in many distributed environments, multiple processes both interact/collaborate with each other and share some common resources. To model and analyse such systems, this article defines a new class of Petri nets called Parallel Process Nets (P2Ns) that may be viewed as a generalization of the two mentioned above. We propose collaborativeness and close collaborativeness for P2Ns. The former guarantees that a modelled system is both deadlock-free and livelock-free, and the latter guarantees that it is deadlock-free, livelock-free, and starvation-free. These concepts and ideas are illustrated through some classical examples such as Producer-Consumer Problem and Dinning Philosophers Problem. Algorithms are developed to decide them. At last, P2Ns are applied to the modelling and analysis of two real systems: hospital information system and elevator scheduling system.
- Paolo Baldan, Andera Corradini, Hartmut Ehrig, and Reiko Heckel. 2001. Compositional semantics of open petri nets based on deterministic processes. Math. Struct. Comput. Sci. 15, 1 (2001), 1--35. DOI:http://dx.doi.org/10.1017/S0960129504004311 Google Scholar
Digital Library
- Kamel Barkaoui and Rabah Benamara. 2003. On concurrency control in multidatabase systems with an extended transaction model. J. Supercomput. 24, 2 (Feb. 2003), 193--202. DOI:http://dx.doi.org/10.1023/A:1021707111118 Google Scholar
Digital Library
- Kamel Barkaoui, Jean-Michel Couvreur, and Kais Klai. 2005. On the equivalence between liveness and deadlock-freeness in petri nets. In Proceedings of the 26th International Conference on Applications and Theory of Petri Nets (ICATPN’05). Springer-Verlag, Berlin, 90--107. DOI:http://dx.doi.org/10.1007/11494744_7 Google Scholar
Digital Library
- Kamel Barkaoui and Awatef Hicheur. 2008. Towards analysis of flexible and collaborative workflow using recursive ECATNets. In Proceedings of the 2007 International Conference on Business Process Management (BPM’07). Springer-Verlag, Berlin, 232--244. http://dl.acm.org/citation.cfm?id=1793714.1793741 Google Scholar
Cross Ref
- Kamel Barkaoui and Jean-François Pradat-Peyre. 1998. Verification in concurrent programming with petri nets structural techniques. In Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE’98). IEEE Computer Society, Washington, DC, 124--133. Google Scholar
Cross Ref
- Luca Bernardinello, Elisabetta Mangioni, and Lucia Pomello. 2013. Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms. Springer, Berlin, 48--70. DOI:http://dx.doi.org/10.1007/978-3-642-40465-8_3 Google Scholar
Cross Ref
- Eike Best. 1987. Structure theory of petri nets: The free choice hiatus. In Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I. Springer-Verlag, London, 168--205. http://dl.acm.org/citation.cfm?id=647421.725644 Google Scholar
Cross Ref
- Yufeng Chen, ZhiWu Li, and Meng Chu Zhou. 2014. Optimal supervisory control of flexible manufacturing systems by petri nets: A set classification approach. IEEE Trans. Autom. Sci. Eng. 11, 2 (2014), 549--563. DOI:http://dx.doi.org/10.1109/TASE.2013.2241762 Google Scholar
Cross Ref
- Jose-Manuel Colom. 2003. The resource allocation problem in flexible manufacturing systems. In Proceedings of the 24th International Conference on Applications and Theory of Petri Nets (ICATPN’03). Springer-Verlag, Berlin, 23--35. http://dl.acm.org/citation.cfm?id=1760066.1760070 Google Scholar
Cross Ref
- Jörg Desel and Javier Esparza. 1995. Free Choice Petri Nets. Cambridge University Press, New York. Google Scholar
Cross Ref
- Joost Engelfriet. 1991. Branching processes of petri nets. Acta Inf. 28, 6 (Sept. 1991), 575--591. DOI:http://dx.doi.org/10.1007/BF01463946 Google Scholar
Digital Library
- Javier Esparza and Keijo Heljanko. 2008. Unfoldings: A Partial-Oder Approach to Model Checking. Springer-Verlag, Berlin. DOI:http://dx.doi.org/10.1007/978-3-540-77426-6 Google Scholar
Cross Ref
- Javier Ezpeleta, Jose-Manuel Colom, and J. Martinez. 1995. A petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Trans. Robot. Autom. 11, 2 (1995), 173--184. DOI:http://dx.doi.org/10.1109/70.370500 Google Scholar
Cross Ref
- Maria P. Fanti and MengChu Zhou. 2004. Deadlock control methods in automated manufacturing systems. IEEE Trans. Syst. Man Cybernet., Part A: Syst. Hum. 34, 1 (2004), 5--22. DOI:http://dx.doi.org/10.1109/TSMCA.2003.820590 Google Scholar
Digital Library
- Alessandro Giua, Frank Dicesare, and Manuel Silva. 1992. Generalized mutual exclusion contraints on nets with uncontrollable transitions. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. 974--979. DOI:http://dx.doi.org/10.1109/ICSMC.1992.271666 Google Scholar
Cross Ref
- Brent Hailpern and Susan Owicki. 1982. Modular verification of concurrent programs. In Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’82). ACM, New York, 322--336. DOI:http://dx.doi.org/10.1145/582153.582187 Google Scholar
Digital Library
- MuDer Jeng, Xiaolan Xie, and ShengLuen Chung. 2004. ERCN* merged nets for modeling degraded behavior and parallel processes in semiconductor manufacturing systems. IEEE Trans. Syst. Man Cybernet. Part A: Syst. Hum. 34, 1 (Jan. 2004), 102--112. DOI:http://dx.doi.org/10.1109/TSMCA.2003.820579 Google Scholar
Digital Library
- Jens B. Jørgensen and Lars M. Kristensen. 1999. Computer aided verification of lamport’s fast mutual exclusion algorithm using colored petri nets and occurrence graphs with symmetries. IEEE Trans. Parallel Distrib. Syst. 10, 7 (July 1999), 714--732. DOI:http://dx.doi.org/10.1109/71.780866 Google Scholar
Digital Library
- Zhiwu Li and Mi Zhao. 2008. On controllability of dependent siphons for deadlock prevention in generalized petri nets. IEEE Trans. Syst. Man Cybernet. Part A: Syst. Hum. 38, 2 (2008), 369--384. DOI:http://dx.doi.org/10.1109/TSMCA.2007.914741 Google Scholar
Digital Library
- ZhiWu Li and MengChu Zhou. 2004. Elementary siphons of petri nets and their application to deadlock prevention in flexible manufacturing systems. Trans. Syst. Man Cybernet. Part A Syst. Hum. 34, 1 (Jan. 2004), 38--51. DOI:http://dx.doi.org/10.1109/TSMCA.2003.820576 Google Scholar
Digital Library
- ZhiWu Li and MengChu Zhou. 2009. Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach (1st ed.). Springer Publishing Company. DOI:http://dx.doi.org/10.1080/00207541003650961 Google Scholar
Cross Ref
- Guanjun Liu and LiJing Chen. 2016. Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait. Int. J. Syst. Sci. 47, 7 (2016), 1533--1542. DOI:http://dx.doi.org/10.1080/00207721.2014.938788 Google Scholar
Digital Library
- Guanjun Liu and Changjun Jiang. 2016. Petri net based model checking for the collaborative-ness of multiple processes systems. In Proceedings of IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC’2016). Mexico City, 1--6. DOI:http://dx.doi.org/10.1109/ICNSC.2016.7478980 Google Scholar
Cross Ref
- Guanjun Liu, ChangJun Jiang, and Daniel Y. Chao. 2011. A necessary and sufficient condition for the liveness of normal nets. Comput. J. 54, 1 (2011), 157--163. DOI:http://dx.doi.org/10.1093/comjnl/bxp118 Google Scholar
Digital Library
- Guanjun Liu, Changjun Jiang, and MengChu Zhou. 2010. Two simple deadlock prevention policies for S3PR based on key-resource/operation-place pairs. IEEE Trans. Autom. Sci. Eng. 7, 4 (2010), 945--957. DOI:http://dx.doi.org/10.1109/TASE.2010.2050059 Google Scholar
Cross Ref
- Guanjun Liu, Changjun Jiang, MengChu Zhou, and PengCheng Xiong. 2013. Interactive petri nets. IEEE Trans. Syst. Man Cybernet. Syst.: Syst. 43, 2 (2013), 291--302. DOI:http://dx.doi.org/10.1109/TSMCA.2012.2204741 Google Scholar
Cross Ref
- Guanjun Liu, Wolfgang Reisig, Changjun Jiang, and Mengchu Zhou. 2016. A branching-process-based method to check soundness of workflow systems. IEEE Access 4 (2016), 4104--4118. DOI:http://dx.doi.org/10.1109/ACCESS.2016.2597061 Google Scholar
Cross Ref
- Marisa Llorens and Javier Oliver. 2004. Structural and dynamic changes in concurrent systems: Reconfigurable petri nets. IEEE Trans. Comput. 53 (2004), 1147--1158. DOI:http://dx.doi.org/10.1109/TC.2004.66 Google Scholar
Digital Library
- Niels Lohmann, Peter Massuthe, and Karsten Wolf. 2007. Operating Guidelines for Finite-State Services. Springer, Berlin, 321--341. DOI:http://dx.doi.org/10.1007/978-3-540-73094-1_20 Google Scholar
Cross Ref
- Axel Martens. 2003. On compatibility of web services. Petri Net Newslett. 65 (2003), 12--20.Google Scholar
- Peter Massuthe, Alexander Serebrenik, Natalia Sidorova, and Karsten Wolf. 2008. Can I find a partner? Undecidability of partner existence for open nets. Inf. Process. Lett. 108, 6 (Nov. 2008), 374--378. DOI:http://dx.doi.org/10.1016/j.ipl.2008.07.006 Google Scholar
Digital Library
- Kenneth L. McMillan. 1993. Symbolic Model Checking. Kluwer Academic Publishers, Norwell, MA. DOI:http://dx.doi.org/10.1007/978-1-4615-3190-6 Google Scholar
Cross Ref
- Atsushi Ohta and Kohkichi Tsuji. 2009. Computational complexity of liveness problem of normal petri net. IEICE Trans. Fund. 92, 11 (Nov 2009), 2717--2722. DOI:http://dx.doi.org/10.1587/transfun.E92.A.2717 Google Scholar
Cross Ref
- Jonghun Park and Spyros A. Reveliotis. 2001. Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings. IEEE Trans. Automat. Control 46, 10 (2001), 1572--1583. DOI:http://dx.doi.org/10.1109/9.956052 Google Scholar
Cross Ref
- Wolfgang Reisig. 2013. Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Berlin. DOI:http://dx.doi.org/10.1007/978-3-642-33278-4 Google Scholar
Cross Ref
- Sol M. Shatz, Shengru Tu, Tadao Murata, and Sastry Duri. 1996. An application of petri net reduction for ada tasking deadlock analysis. IEEE Trans. Parallel Distrib. Syst. 7, 12 (Dec. 1996), 1307--1322. DOI:http://dx.doi.org/10.1109/71.553301 Google Scholar
Digital Library
- Murat Uzam and MengChu Zhou. 2007. An iterative synthesis approach to petri net-based deadlock prevention policy for flexible manufacturing systems. Trans. Syst. Man Cyber. Part A 37, 3 (May 2007), 362--371. DOI:http://dx.doi.org/10.1109/TSMCA.2007.893484 Google Scholar
Digital Library
- F. Vallejo, J. A. Gregorio, M. González Harbour, and J. M. Drake. 1994. Shared memory multimicroprocessor operating system with an extended petri net model. IEEE Trans. Parallel Distrib. Syst. 5, 7 (July 1994), 749--762. DOI:http://dx.doi.org/10.1109/71.296320 Google Scholar
Digital Library
- Antti Valmari. 1998. The state explosion problem. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the Volumes Are Based on the Advanced Course on Petri Nets. Springer-Verlag, London, 429--528. http://dl.acm.org/citation.cfm?id=647444.727054 Google Scholar
Cross Ref
- Wil M. Van Der Aalst, Arjan J. Mooij, Christian Stahl, and Karsten Wolf. 2009. Formal Methods for Web Services. Springer-Verlag, Berlin, 42--88. DOI:http://dx.doi.org/10.1007/978-3-642-01918-0_2 Google Scholar
Digital Library
- Wil M. P. Van Der Aalst. 1999. Process-oriented architectures for electronic commerce and interorganizational workflow. Info. Syst. 24, 9 (Dec. 1999), 639--671. Google Scholar
Cross Ref
- Shouguang Wang, Chengying Wang, and Yanping Yu. 2013. Design of liveness-enforcing supervisors for S3PR based on complementary places. ACM Trans. Embed. Comput. Syst. 12, 1, Article 2 (Jan. 2013). DOI:http://dx.doi.org/10.1145/2406336.2406338 Google Scholar
Digital Library
- NaiQi Wu and MengChu Zhou. 2007. Deadlock resolution in automated manufacturing systems with robots. IEEE Trans. Autom. Sci. Eng. 4, 3 (2007), 474--480. DOI:http://dx.doi.org/10.1109/TASE.2006.888049 Google Scholar
Cross Ref
- Zhehui Wu and Tadao Murata. 1985. A petri net model of a starvation-free solution to the dining philosopher’s problem. In Proceedings of IEEE Workshop on Languages for Automation. 192--195.Google Scholar
- Dongming Xiang, Guanjun Liu, Chungang Yan, and Changjun Jiang. 2016. Checking the inconsistent data in concurrent systems by petri nets with data operations. In Proceedings of IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS’2016). IEEE, 501--508. DOI:http://dx.doi.org/10.1109/ICPADS.2016.0073 Google Scholar
Cross Ref
- Keyi Xing, MengChu Zhou, Feng Wang, Huixia Liu, and Feng Tian. 2011. Resource-transition circuits and siphons for deadlock control of automated manufacturing systems. IEEE Trans. Syst. Man Cyber. Part A Syst. Hum. 41, 1 (Jan. 2011), 74--84. DOI:http://dx.doi.org/10.1109/TSMCA.2010.2048898 Google Scholar
Digital Library
Index Terms
Petri Net Models and Collaborativeness for Parallel Processes with Resource Sharing and Message Passing
Recommendations
Timing and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreover, the class of continuous models thus obtained may be interesting in itself. ...
Petri nets and resource bisimulation
Concurrency Specification and Programming (CS&P'2002), Part 2Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn't change the Petri net's behavior. We define the relations of resource similarity and resource ...
Petri nets and resource bisimulation
Concurrency specification and programmingResources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn't change the Petri net's behavior. We define the relations of resource similarity and resource ...






Comments