Sequential and distributed model checking of Petri nets

Authors:
Alexander Bell;Boudewijn R. Haverkort
Affiliations:
RWTH Aachen, Department of Computer Science, Laboratory for Performance Evaluation and Distributed Systems, 52056, Aachen, Germany;RWTH Aachen, Department of Computer Science, Laboratory for Performance Evaluation and Distributed Systems, 52056, Aachen, Germany
Venue:
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Year:
2005

Citing 0
Cited 11

Distributed disk-based algorithms for model checking very large Markov chains

Formal Methods in System Design
Formal analysis techniques for gossiping protocols

ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Model-Checking Large Finite-State Systems and Beyond

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Multi-Core Solver for Parity Games

Electronic Notes in Theoretical Computer Science (ENTCS)
Dynamic Slicing Techniques for Petri Nets

Electronic Notes in Theoretical Computer Science (ENTCS)
A Pattern Recognition Approach for Speculative Firing Prediction in Distributed Saturation State-Space Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed verification: exploring the power of raw computing power

FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
A dynamic firing speculation to speedup distributed symbolic state-space generation

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Cluster-Based LTL model checking of large systems

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Distributed model-checking and counterexample search for CTL logic

International Journal of Critical Computer-Based Systems
Distributed CTL model-checking and counterexample search

VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present sequential as well as distributed algorithms for model checking computational tree logic over finite-state systems specified as Petri nets. The algorithms rely on an explicit representation of the system’s state space but do not require the transition relation to be explicitly available; it is recomputed whenever required. This approach allows us to model check very large systems, with hundreds of millions of states, in a fast and efficient way. For the case studies addressed, the distributed algorithms scale very well, as they show efficiencies in the range of 60% to 95%, depending on the test cases and case studies at hand.