Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Markovian models for performance and dependability evaluation
Lectures on formal methods and performance analysis
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
Symbolic Methods for the State Space Exploration of GSPN Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Implicit GSPN reachability set generation using decision diagrams
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Distributed disk-based algorithms for model checking very large Markov chains
Formal Methods in System Design
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Distributed Verification of Multi-threaded C++ Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Parallel and Distributed Invariant Checking of Microcontroller Software
Electronic Notes in Theoretical Computer Science (ENTCS)
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Symbolic Bounded Property Checking
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
Tutorial: parallel model checking
Proceedings of the 14th international SPIN conference on Model checking software
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Parallel explicit state reachability analysis and state space construction
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Cluster-Based LTL model checking of large systems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A tool to model traffic aggregation in networks of reconfigurable optical ADD/DROP multiplexers
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Self-adaptive containers: building resource-efficient applications with low programmer overhead
Proceedings of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Managing energy in a network of reconfigurable optical add/drop multiplexers
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
In this paper we present efficient techniques for the generation of very large continuous-time Markov chains (CTMCs) specified as stochastic Petri nets (SPNs). In particular, we investigate how the storage efficiency of the reachability graph generation can be improved by using good state coding techniques and by using hashing tables instead of tree-based data structures. These techniques allow us to analyze SPNs with almost 55 million states on a single workstation. The size of the SPNs that can be handled is then further enlarged by using a cluster of workstations. With 16 work- stations, connected via a 100 Mbps Ethernet, we can generate reachability graphs with over 400 million states in reasonable time.The presented techniques have been realized in a prototype tool (PARSECS) implemented in C++ using the libraries STL and MPICH. The SPNs to be input to PARSECS are specified using CSPL, known from the tool SPNP.In the paper we present our techniques and study their performance for a number of case studies. We also present comparisons with SPNP.