Free choice Petri nets
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications
Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications
Net Reductions for LTL Model-Checking
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Complexity Results for 1-safe Nets
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Compositional Analysis with Place-Bordered Subnets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
An Incremental and Modular Technique for Checking LTL\X Properties of Petri Nets
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Pre-and post-gglomerations for LTL model checking
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Slicing Petri nets with an application to workflow verification
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
| Hi-index | 0.00 |
As a means to tackle the state explosion problem of model checking 1-safe Petri nets for linear time logic without next-time (LTL$_{\textrm{-\tiny{X}}}$), an approach that combines compositional verification and Petri net reductions is presented. We decompose a Petri net into (i) a so-called kernel net Σ k containing all places mentioned by the LTL$_{\textrm{-\tiny{X}}}$ property φ and (ii) environment subnets . These environment nets do not interact with each other and have limited influence on the kernel only. Six distinct and very simple summary nets suffice to describe the influence of any environment net. To determine the appropriate summary net we modularly verify up to three fixed LTL$_{\textrm{-\tiny{X}}}$ formulas on . We reduce Σ by replacing every environment subnet in Σ by its summary net. Instead of checking φ on Σ, we check φ on the reduced net. Verification of several case-studies shows that our reduction approach can significantly speed-up model checking.