Program Dependence Net Reduction for LTL Model Checking
Authors: 
Li'ao Zheng, Shuo Li, Zhijun DingAuthors Info & Claims
Li'ao Zheng, Shuo Li, Zhijun DingAuthors Info & ClaimsPages 48 - 56
Abstract
The Net Reduction technique reduces a large model into a smaller model through structural reduction. In model checking, a smaller net means smaller state sizes and explored path lengths. There are many effective reduction rules on low-level net, but on PDNet, some rules may break net information. We have improved the reduction rules traditionally applied to low-level net and proposed implicit place rule and local reduction rules that are more suitable for PDNet to avoid breaking information and the net. And we improve the efficiency of some rules based on the characteristics of PDNet.
References
[1]
Esparza J, Römer S, Vogler W. An Improvement of McMillan's Unfolding Algorithm[J]. Formal Methods in System Design, 2002,20(3):285-310.
[2]
McMillan K L. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits[C], Berlin, Heidelberg, 1993. Springer Berlin Heidelberg, 1993.
[3]
Li S, Zheng L, Ding Z. Partial-order Checking with Unfolding for Linear Temporal Properties[Z]. 2023.
[4]
He C, Ding Z. More Efficient On-the-Fly Verification Methods of Colored Petri Nets[J]. Comput. Informatics, 2021,40:195-215.
[5]
Ding Z, Li S, Chen C, Program Dependence Net and On-demand Slicing for Property Verification of Concurrent System and Software[Z]. 2023.
[6]
Desel J. Reduction and design of well-behaved concurrent systems[C], Berlin, Heidelberg, 1990. Springer Berlin Heidelberg, 1990.
[7]
Esparza J. Reduction and Synthesis of Live and Bounded Free Choice Petri Nets[J]. Information and Computation, 1994,114(1):50-87.
[8]
Haddad S, Pradat-Peyre J. New Efficient Petri Nets Reductions for Parallel Programs Verification[J]. Parallel Process. Lett., 2006,16:101-116.
[9]
Lee-Kwang H, Favrel J, Baptiste P. Generalized Petri Net Reduction Method[J]. IEEE Transactions on Systems, Man, and Cybernetics, 1987,17(2):297-303.
[10]
Khomenko V, Koutny M. Verification of bounded Petri nets using integer programming[J]. Formal Methods in System Design, 2007,30(2):143-176.
[11]
Esparza J, Schröter C. Net Reductions for LTL Model-Checking[C], Berlin, Heidelberg, 2001. Springer Berlin Heidelberg, 2001.
[12]
Shi Y, Duan Z, Tian C, Improved Net Reductions for LTL$$\setminus $$X Model Checking[C], Cham, 2014. Springer International Publishing, 2014.
[13]
Desel J O R, Esparza J. Free Choice Petri Nets[M]. USA: Cambridge University Press, 1995.
[14]
Reisig W. Petri Nets[C], 1985.
[15]
Colom J M, Silva M. Improving the linearly based characterization of P/T nets[C], Berlin, Heidelberg, 1991. Springer Berlin Heidelberg, 1991.
[16]
Esparza J, Heljanko K. Implementing LTL model checking with net unfoldings[C], Berlin, Heidelberg, 2001. Springer Berlin Heidelberg, 2001.
[17]
R. Rangarangi Hokmabad, M. A. Badamchizadeh, and S. Khanmohammadi, "Fault Diagnosis of Discrete Event Systems Using Hybrid Petri Nets," International Journal of Computer Theory and Engineering vol. 4, no. 2, pp. 288-292, 2012.[J].
[18]
Afifa Ghenai, Hadjer Slimani, and Mohamed Benmohammed, "SaNTEA: Stopwatch Petri Net Based Tool for Embedded Systems Analysis" International Journal of Computer Theory and Engineering vol. 6, no. 4, pp. 319-325, 2014.[J].
[19]
Jensen K, Kristensen L M. Formal Definition of Non-hierarchical Coloured Petri Nets[M]//Jensen K, Kristensen L M. Coloured Petri Nets: Modelling and Validation of Concurrent Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009:79-94.
[20]
Vardi M Y. An automata-theoretic approach to linear temporal logic[M]//Moller F, Birtwistle G. Logics for Concurrency: Structure versus Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996:238-266.
Index Terms
- Program Dependence Net Reduction for LTL Model Checking
Recommendations
Improved Net Reductions for LTLX Model Checking
Structured Object-Oriented Formal Language and MethodAbstractA set of reduction rules for LTLX model checking of 1-safe Petri nets are presented in this paper. Compared with the rules available, more original transitions and places could be removed from the synchronization of Büchi automata obtained from ...
Reduction rules for reset/inhibitor nets
Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancellation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An ...
Soundness-preserving reduction rules for reset workflow nets
The application of reduction rules to any Petri net may assist in its analysis as its reduced version may be significantly smaller while still retaining the original net's essential properties. Reset nets extend Petri nets with the concept of a reset ...
Comments
Information & Contributors
Information
Published In
May 2024
94 pages
ISBN:9798400718052
DOI:10.1145/3686614
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 October 2024
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICSED 2024
ICSED 2024: 2024 6th International Conference on Software Engineering and Development
May 29 - 31, 2024
Hong Kong, Hong Kong
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 4Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)2
Reflects downloads up to 28 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format