Introduction to algorithms
On finding and updating shortest paths distributively
Journal of Algorithms
Efficient parallel shortest-paths in digraphs with a separator decomposition
Journal of Algorithms
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Distributed LTL model-checking in SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Parallel Processing and Parallel Algorithms: Theory and Computation
Parallel Processing and Parallel Algorithms: Theory and Computation
A Parallelization of Dijkstra's Shortest Path Algorithm
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Distributed-Memory Model Checking with SPIN
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Scalable Distributed On-the-Fly Symbolic Model Checking
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Parallel Model Checking for the Alternation Free µ-Calculus
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Local Parallel Model Checking for the Alternation-Free µ-Calculus
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
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
Scalable Multi-core Model Checking Fairness Enhanced Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Parallel nested depth-first searches for LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Cluster-Based LTL model checking of large systems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Action-based discovery of satisfying subsets: A distributed method for model correction
Information and Software Technology
Hi-index | 0.00 |
This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All the known methods for automata based model checking are based on depth first traversal of the state space which is difficult to parallelise as the ordering in which vertices are visited plays an important role. We come up with entirely different approach which is dependent on locating cycles with negative length in a directed graph with real number length of edges. Our method allows reasonable distribution and the experimental results confirm its usefulness for distributed model checking.