Ranran Tao
ABSTRACT
Due to its intuitive graphical representation and variety of mathematical analysis methods, Petri nets are widely used in modeling and analysis of distributed and concurrent systems. However, state explosion problem has been hampering the practical application of Petri nets. Because the state explosion problem mainly results from arbitrary interleaving of highly concurrent activities, net unfolding technology and its complete finite prefixes have been proposed to overcome the problem. Now, with the vigorous development, net unfolding technology is widely applied to many areas including soundness verification of workflow nets, verification of multi-agent system, etc. This paper presents an overview of the latest advances in Petri net unfolding technology and its application. In addition, some promising research directions in unfolding of unbounded Petri nets are proposed.
- Chongyi Yuan. Petri Net Application{M}. Beijing: Science Press, 2013.Google Scholar
- Li Z W, Wu N Q, Zhou M C. Deadlock control of automated manufacturing systems based on Petri nets---aliterature review{J}. IEEE Transactions on Systems Man & Cybernetics Part C, 2012, 42(4):437--462. Google ScholarDigital Library
- Qingtian Zeng, Faming Lu, Cong Liu et al. Modeling and analysis of interorganizational emergency management system based on Petri net{J}. Chinese Journal of Computers, 2013, 36(11):2290--2302.Google Scholar
- Nielsen M, Plotkin G, Winskel G. Petri nets, event structures and domains, part I{J}. Theoretical Computer Science, 1981, 13(1):85--108.Google ScholarCross Ref
- McMillan K L. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits{C}// International Workshop on Computer Aided Verification. Springer-Verlag, 1992:164--177. Google ScholarDigital Library
- Bonet B, Haslum P, Khomenko V, et al. Recent advances in unfolding technique{J}. Theoretical Computer Science, 2014, 551:84--101. Google ScholarDigital Library
- Esparza J, Vogler W. An Improvement of McMillan's Unfolding Algorithm. In TACAS'96{C}// Tools and Algorithms for Construction and Analysis of Systems. 1996. Google ScholarDigital Library
- Blanco E, Cardinale Y, Vidal M E, et al. Techniques to Produce Optimal Web Service Compositions{C}// IEEE Congress on Services. IEEE Computer Society, 2008:553--558. Google ScholarDigital Library
- Khomenko V, Koutny M, Vogler W. Canonical Prefixes of Petri Net Unfoldings{C}// International Conference on Computer Aided Verification. Springer-Verlag, 2002:582--595. Google ScholarDigital Library
- Abdulla P A, Iyer S P, Nylen A. Unfoldings of Unbounded Petri Nets{C}// Computer Aided Verification, International Conference, CAV 2000, Chicago, Il, Usa, July 15-19, 2000, Proceedings. DBLP, 2000:495--507. Google ScholarDigital Library
- Desel J, Juhás G, Neumair C. Finite Unfoldings of Unbounded Petri Nets{C}// Applications and Theory of Petri Nets 2004, International Conference, Icatpn 2004, Bologna, Italy, June 21-25, 2004, Proceedings. DBLP, 2004:157--176.Google Scholar
- Liu G, Reisig W, Jiang C, et al. A Branching-Process-Based Method to Check Soundness of Workflow Systems{J}. IEEE Access, 2016, 4:4104--4118.Google ScholarCross Ref
- Zhang K, Liu G, Xiang D. BUCKER: A basic unfolding based checker for soundness of workflow systems{C}// IEEE, International Conference on Networking, Sensing and Control. IEEE, 2017:611--616.Google Scholar
- Esparza J, Esparza J, Esparza J. Minimizing Test Suites with Unfoldings of Multithreaded Programs{J}. Acm Transactions on Embedded Computing Systems, 2017, 16(2):45. Google ScholarDigital Library
- L. Jezequel, A. Madalinski, S. Schwoon, Distributed computation of vector clocks in Petri nets unfolding for test selection, Workshop on Discrete Event Systems (WODES), May 2018, Sorrento, Italy. http://www.lsv.fr/Publis/PAPERS/PDF/JMS-hal18.pdf.Google Scholar
- Wang H, Buy U. DEADLOCK DETECTION WITH STUBBORN UNFOLDINGS{J}. 2008.Google Scholar
- Liu G, Zhang K, Jiang C. Deciding the Deadlock and Livelock in a Petri Net with a Target Marking Based on Its Basic Unfolding{M}// Algorithms and Architectures for Parallel Processing. 2016.Google Scholar
- Bonet B, Haslum P, Hickmott S, et al. Directed Unfolding of Petri Nets{J}. Lecture Notes in Computer Science, 2008, 1(1):172--198. Google ScholarDigital Library
- Chatain T, Paulevé L. Goal-Driven Unfolding of Petri Nets{R}. arXiv:1611. 01296{cs. LO}. 2016.Google Scholar
- Madalinski A, Fabre E. Modular construction of finite and complete prefixes of Petri net unfoldings{C}// International Conference on Application of Concurrency To System Design. IEEE, 2009:68--77.Google Scholar
- C. Rodríguez, M. Sousa, S. Sharma, D. Kroening, Unfolding-based partial order reduction, arXiv: Computer Science, 2015. https://arxiv.org/pdf/1507.00980v1.pdfGoogle Scholar
- Rodríguez C, Schwoon S, Baldan P. Efficient Contextual Unfolding{C}// International Conference on Concurrency Theory. Springer, Berlin, Heidelberg, 2011:342--357. Google ScholarDigital Library
- Xiang D, Liu G, Yan C, et al. Detecting Data Inconsistency Based on the Unfolding Technique of Petri Nets{J}. IEEE Transactions on Industrial Informatics, 2017, PP(99):1--1.Google Scholar
- V. Khomenko, Model checking based on prefixes of Petri net unfoldings, Ph. D. thesis, School of Computing Science, Newcastle University, 2003.Google Scholar
- Esparza J, Heljanko K. Implementing LTL model checking with net unfoldings{C}// IEEE, 2001:37--56. Google ScholarDigital Library
- Esparza J, Heljanko K. Unfoldings: A Partial-Order Approach to Model Checking{J}. 2008, 1853(1):475--486. Google ScholarDigital Library
- Lomazova I A, Ermakova V O. Verication of Nested Petri Nets Using an Unfolding Approach{C}// International Workshop on Petri Nets and Software Engineering. 2016.Google Scholar
- Rodríguez C, Schwoon S. Verification of Petri Nets with Read Arcs{M}// CONCUR 2012 - Concurrency Theory. Springer Berlin Heidelberg, 2012:471--485. Google ScholarDigital Library
- Xiang D, Liu G, Yan C, et al. DICER: Data Inconsistency CheckER based on the unfolding technique of Petri net{C}// IEEE, International Conference on Networking, Sensing and Control. IEEE, 2017:115--120.Google Scholar
- Kähkönen K, Saarikivi O, Heljanko K. Using unfoldings in automated testing of multithreaded programs{C}// Proceedings of the, Ieee/acm International Conference on Automated Software Engineering. IEEE, 2012:150--159. Google ScholarDigital Library
- León H P D, Saarikivi O, Kähkönen K, et al. Unfolding Based Minimal Test Suites for Testing Multithreaded Programs{C}// International Conference on Application of Concurrency To System Design. IEEE, 2015:40--49. Google ScholarDigital Library
- Haar S, Longuet D. Model-based testing for concurrent systems: unfolding-based test selection{J}. International Journal on Software Tools for Technology Transfer, 2016, 18(3):305--318. Google ScholarDigital Library
- Blanco E, Cardinale Y, Vidal M E. A Non-Chronological Backtracking Unfolding Algorithm for Transactional Web Service Composition{J}. Procedia Computer Science, 2012, 10(4):888--893.Google ScholarCross Ref
- Faming Lu, Qingtian Zeng, Mengchu Zhou, Yunxia Bao, Hua Duan. Complex Reachability Trees and Their Application to Deadlock Detection for Unbounded Petri Nets {J}, IEEE Transactions on Systems, Man and Cybernetics: Systems, 2017 PP(99):1--11. 2017. 2692262Google Scholar
Index Terms
- An introduction and review of petri net unfolding technology
Recommendations
Revisiting Petri Net Modeling of the Cigarette Smokers' Problem: A GPenSIM Approach
EMS '13: Proceedings of the 2013 European Modelling SymposiumPetri Nets is a family of modeling formalisms, with different interpretations and abstraction levels; the Petri nets family of modeling formalisms includes ordinary Petri Net, generalized Petri Net, and also all other extensions e.g. Colored Petri Net, ...
Analysis of Signed Petri net
In this paper, the behavioural properties of Signed Petri net (SPN) are given along with the two techniques: reachability tree and matrix equations to analyse the SPN. An actual case scenario of a restaurant model is given and analysed using the ...
Deadlock analysis and control using Petri net decomposition techniques
AbstractPetri nets are an effective tool for modeling and analyzing deadlock problems of flexible manufacturing systems (FMSs). Based on Petri nets, this paper proposes a decomposition method for deadlock control of a class of Petri net ...
Comments