Local parallel model checking for the alternation-free μ-calculus

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

Volumn 2318 LNCS, Issue , 2002, Pages 128-147

  Bollig, Benedikt ^a   Leucker, Martin ^b   Weber, Michael ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; GAME THEORY; PROGRAM DEBUGGING; TEMPORAL LOGIC; ALGORITHMS; COMPLEX NETWORKS;

MU-CALCULUS; NETWORK OF WORKSTATIONS; PARALLEL MODEL CHECKING; PROTOTYPE IMPLEMENTATIONS; TWO-PLAYER GAMES; UNDERLYING SYSTEMS; VERIFICATION TOOLS; WINNING STRATEGY;

MODEL CHECKING;

EID: 84893620028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46017-9_11     Document Type: Conference Paper

References (23)

1. H. R. Andersen. Model checking and Boolean graphs. Theoretical Computer Science, 126(1):3-30, 11 Apr. 1994.
2. S. Basonov. Parallel implementation of BDD on DSM systems. Master's thesis, Computer Science Department, Technion, 1998.
3. S. Blom, W. Fokkink, J. F. Groote, I. van Langevelde, B. Lisser, and J. van de Pol. μCRL: a toolset for analysing algebraic specifications. In G. Berry, H. Comon, and A. Finkel, editors, Proc. of the 13th Conference on Computer-Aided Verification (CAV'01), LNCS 2102, p. 250-254. Springer, July 2001.
4. B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free μ-calculus. Technical Report AIB-04-2001, RWTH Aachen, 03/2001.
5. B. Bollig, M. Leucker, and M. Weber. Parallel model checking for the alternation free μ-calculus. In T. Margaria and W. Yi, editors, Proc. of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), LNCS 2031, p. 543-558. Springer, Apr. 2001.
6. L. Brim, I. Černá, P. Krčál, and R. Pelánek. Distributed LTL model-checking based on negative cycle detection. In Proc. of 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), LNCS. Springer, Dec. 2001.
7. G. Cabodi, P. Camurati, and S. Que. Improved reachability analysis of large FSM. In Proc. of the IEEE International Conference on Computer-Aided Design, p. 354-360. IEEE Computer Society Press, June 1996.
8. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
9. E. W. Dijkstra, W. H. J. Feijen, and A. J. M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16(5):217-219, June 1983.
10. E. A. Emerson and E. M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.
11. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of mu-calculus. In C. Courcoubetis, editor, Proc. 5th International Computer-Aided Verification Conference, LNCS 697, p. 385-396. Springer, 1993.
12. O. Grumberg, T. Heyman, and A. Schuster. Distributed symbolic model checking for μ-calculus. In G. Berry, H. Comon, and A. Finkel, editors, Proc. of the 13th Conference on Computer-Aided Verification (CAV'01), of LNCS 2102, p. 350-362. Springer, July 2001.
13. H. Hiraishi, K. Hamaguchi, H. Ochi, and S. Yajima. Vectorized symbolic model checking of computation tree logic for sequential machine verification. In K. G. Larsen and A. Skou, editors, Proc. of Computer Aided Verification (CAV '91), LNCS 575, p. 214-224, Berlin, Germany, July 1992. Springer.
14. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, Dec. 1983.
15. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, Mar. 2000.
16. M. Leucker. Model checking games for the alternation free mu-calculus and alternating automata. In H. Ganzinger, D. McAllester, and A. Voronkov, editors, Proc. of the 6th International Conference on Logic for Programming and Automated Reasoning "(LPAR'99),", LNAI 1705, p. 77-91. Springer, 1999.
17. M. Leucker and T. Noll. Truth/SLC - A parallel verification platform for concurrent systems. In G. Berry, H. Comon, and A. Finkel, editors, Proc. of the 13th Conference on Computer-Aided Verification (CAV'01), LNCS 2102, p. 255-259. Springer, July 2001.
18. A. Mader. Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, Technische Universität München, 1996.
19. A. A. Narayan, J. J. J. Isles, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Reachability analysis using partitioned-roBBDs. In Proc. of the IEEE International Conference on Computer-Aided Design, p. 388-393. IEEE Computer Society Press, June 1997.
20. U. Stern and D. L. Dill. Parallelizing the Murφ verifier. In O. Grumberg, editor, Computer-Aided Verification, 9th International Conference, LNCS 1254, p. 256-267. Springer, June 1997. Haifa, Israel, June 22-25.
21. C. Stirling. Games for bisimulation and model checking, July 1996. Notes for Mathfit Workshop on finite model theory, University of Wales, Swansea.
22. A. L. Stornetta. Implementation of an efficient parallel BDD package. Master's thesis, University of California, Santa Barbara, 1995.
23. S. Zhang, O. Sokolsky, and S. A. Smolka. On the parallel complexity of model checking in the modal mu-calculus. In Proc. of the 9th Annual IEEE Symposium on Logic in Computer Science, p. 154-163, Paris, France, 4-7 July 1994. IEEE Computer Society Press.