Distributed LTL model checking based on negative cycle detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2245, Issue , 2001, Pages 96-107

  Brim, Luboš ^a   Černá, Ivana ^a   Krčál, Pavel ^a   Pelánek, Radek ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIRECTED GRAPHS; ROBOTS;

CYCLE DETECTION; DEPTH FIRST; DISTRIBUTED APPROACHES; DISTRIBUTED MODEL CHECKING; LARGE SPACES; LTL MODEL-CHECKING; REAL NUMBER; STATE EXPLOSION PROBLEMS;

MODEL CHECKING;

EID: 84944038984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45294-x_9     Document Type: Conference Paper

References (26)

1. S. Aggarwal, R. Alonso, and C. Courcoubetis. Distributedreac hability analysis for protocol verification environments. In Discrete Event Systems: Models and Application, volume 103 of LNCS, pages 40–56. Springer, 1987.
2. J. Barnat, L. Brim, and J. Stříbrná. DistributedLTL Model-Checking in SPIN. In Proc. SPIN 2001, volume 2057 of LNCS, pages 200–216. Springer, 2001.
3. G. Behrmann, T. S. Hune, and F. W. Vaand rager. Distributedtimedmo del checking — how the search order matters. In Proc. CAV 2000, volume 1855 of LNCS, pages 216–231. Springer, 2000.
4. S. Ben-David, T. Heyman, O. Grumberg, and A. Schuster. Scalable distributed on-the-fly symbolic model checking. In Proc. FMCAD 2000, 2000.
5. B. Bollig, M. Leucker, and M Weber. Parallel model checking for the alternation free mu-calculus. In Proc. TACAS 2001, volume 2031 of LNCS, pages 543–558. Springer, 2001.
6. L. Brim, I. Černá, P. Krčál, and R. Pelánek. Distributedshortest path for directed graphs with negative edge lengths. Technical Report FIMU-RS-2001-01, Faculty of Informatics, Masaryk University Brno, http://www.fi.muni.cz/informatics/reports/, 2001.
7. S. Chaudhuri and C. D. Zaroliagis. Shortest path queries in digraphs of small treewidth. In Proc. ESA 1995, volume 979 of LNCS, pages 31–45. Springer, 1995.
8. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. Mathematical Programming, (85):277–311, 1999.
9. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Progress on the state explosion problem in model checking. In Informatics - 10 Years Back. 10 Years Ahead, volume 2000 of LNCS, pages 176–194. Springer, 2001.
10. E. Cohen. Efficient parallel shortest-paths in digraphs with a separator decomposition. Journal of Algorithms, 21(2):331–357, 1996.
11. T. H. Cormen, Ch. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT, 1990.
12. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra’s shortest path algorithm. In Proc. MFCS 1998, volume 1450 of LNCS, pages 722–731. Springer, 1998.
13. P. Spirakis, D. Kavvadias, G. Pantziou and C. Zaroliagis. Efficient sequential and parallel algorithms for the negative cycle problem. In Proc. ISAAC 1994, volume 834 of LNCS, pages 270–278. Springer, 1994.
14. O. Grumberg, T. Heyman, and A. Schuster. Distributedmo del checking for mucalculus. In Proc. 13th Conference on Computer-Aided Verification CAV01, LNCS. Springer, 2001.
15. T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving scalability in parallel reachability analysis of very large circuits. In Proc. CAV 2000, volume 1855 of LNCS, pages 20–35. Springer, 2000.
16. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, 1997.
17. G.J. Holzmann, D. Peled, and M. Yannakakis. On nestedd epth first search. In The Spin Verification System, pages 23–32. American Mathematical Society, 1996.
18. F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Proc. SPIN 1999, number 1680 in LNCS. Springer, 1999.
19. U. Meyer and P. Sanders. Parallel shortest path for arbitrary graphs. In Proc. EUROPAR 2000. LNCS, 2000.
20. K. Ramarao and S. Venkatesan. On finding and updating shortest paths distributively. Journal of Algorithms, 13:235–257, 1992.
21. J.H. Reif. Depth-first search is inherrently sequential. Information Processing Letters, 20(5):229–234, 1985.
22. S.H. Roosta. Parallel processing and parallel algorithms. Springer, 2000.
23. U. Stern and D.L. Dill. Parallelizing the Murϕ verifier. In Proc. CAV 1997, volume 1254 of LNCS, pages 256–267. Springer, 1997.
24. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on computing, pages 146–160, 1972.
25. J. Traff and C.D. Zaroliagis. A simple parallel algorithm for the single-source shortest path problem on planar digraphs. In Proc. IRREGULAR-3 1996, volume 1117 of LNCS, pages 183–194S. Springer, 1996.
26. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. LICS 1986, pages 332–344. Computer Society Press, 1986.