How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors

Authors:
L. Brim;I. Černá;P. Moravec;J. Šimša
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 10
Cited 3

Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
Distributed LTL model-checking in SPIN

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Parallel state space construction for model-checking

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Local Parallel Model Checking for the Alternation-Free µ-Calculus

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Scalable Distributed On-the-Fly Symbolic Model Checking

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
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
Parallelizing the Murphi Verifier

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
The circuit value problem is log space complete for P

ACM SIGACT News
Distributed reachability analysis in timed automata

International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking

The Design of a Multicore Extension of the SPIN Model Checker

IEEE Transactions on Software Engineering
Generating counter-examples through randomized guided search

Proceedings of the 14th international SPIN conference on Model checking software
A Sweep-Line Method for Büchi Automata-based Model Checking

Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a Buchi automaton. The approach to distributed accepting cycle detection as presented in [L. Brim, I. Cerna, P. Moravec, J. Simsa. Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In Formal Methods in Computer-Aided Design (FMCAD'04), volume 3312 of LNCS, pages 352-366. Springer, 2004] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as an imperfect ordering can enforce numerous re-explorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally to find out which of these work well.