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 2031 LNCS, Issue , 2001, Pages 543-558

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; TEMPORAL LOGIC; ALGORITHMS;

DESIGN AND IMPLEMENTATIONS; MODEL CHECKING PROBLEM; MU-CALCULUS; NETWORK OF WORKSTATIONS; PARALLEL MODEL CHECKING; TWO PERSON GAME; VERIFICATION TOOLS;

MODEL CHECKING;

EID: 84903214497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_37     Document Type: Conference Paper

References (26)

1. S. Basonov. Parallel implementation of BDD on DSM systems. Master's thesis, Computer Science Department, Technion, 1998.
2. G. Cabodi, P, Camurati, and S. Que. Improved reachability analysis of large FSM. In Proc. IEEE Int. Conf. on Computer Aided Design, pages 354-360. IEEE Computer Society Press, June 1996.
3. E. M. Clarke and J. Wing. Formal methods: State of the art and future directions. Technical Report CMU-CS-96-178, Carnegie Mellon University (CMU), Sept. 1996.
4. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In Proc. Computer Aided Verification (CAV '91), volume 575 of LNCS, Springer, 1992
5. 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.
6. 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.
7. S. Gnesi et. al., A formal specification and validation of a critical system in presence of byzantine errors. In Proc. 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, number 1785 in LNCS. Springer, 2000.
8. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory, Oxford University Press, 1995.
9. T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving scalability in parallel reachability analysis of very large circuits. In Computer Aided Verification, 12th Int. Conf., volume 1855 of LNCS, pages 20-35. Springer-Verlag, June 2000.
10. A. J. Hu, G. York, and D. L. Dill. New techniques for efficient verification with implicitly conjoined BDDs. In 31st Design Automation Conference, 1994.
11. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, Dec. 1983.
12. O. Kupferman, M. Y. Vardi, and P. Wolper. An automat a-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, Mar. 2000.
13. M. Lange. Spielbasiertes Mo del-Checking für den alternierungsfreien mu-Kalkül. Master's thesis, Aachen, University of Technology, 1999. (German).
14. M. Lange, M. Leucker, T. Noll, and S. Tobies. Truth - a verification platform for concurrent systems. In Tool Support for System Specification, Development, and Verification, Advances in Computing Science. Springer-Verlag, 1999.
15. B. P. Lester. The Art of Parallel Programming. Prentice Hall, 1993.
16. M. Leucker. Model checking games for the alternation free mu-calculus and alternating automata. In Proc. 6th Int. Conf. on Logic for Programming and Automated Reasoning, volume 1705 of LNAI, pages 77-91. Springer, 1999.
17. K. L. McMillan. Symbolic Model Checking, Kluwer Academic Publishers, 1993.
18. R. Milner. Communication and Concurrency, Prentice Hall, 1989.
19. A. A. Narayan, J. J. J. Isles, R. K. Brayto, and A. L. Sangiovanni-Vincentelli. Reachability analysis using partitioned-roBBDs. In Proc. IEEE Int. Conf. on Computer Aided Design, pages 388-393. IEEE Computer Society Press, June 1997.
20. D. Peled. Ten years of partial order reduction. In CAV, Computer Aided Verification, number 1427 in LNCS, pages 17-28, Vancouver, BC, Canada, 1998. Springer.
21. J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229-234, June 1985.
22. S. H. Roosta. Parallel Processing and Parallel Algorithms. Springer, 1999.
23. U. Stern and D. L. Dill. Parallelizing the Mur
24. C. Stirling. Games for bisimulation and model checking, July 1996. Notes for Mathfìt Workshop on finite model theory, University of Wales, Swansea,.
25. A. L. Stornetta. Implementation of an efficient parallel BDD package. Master's thesis, University of California, Santa Barbara, 1995.
26. S. Zhang, O. Sokolsky, and S. A. Smolka. On the parallel complexity of model checking in the modal mu-calculus. In Proc. 9th Annual IEEE Symposium on Logic in Computer Science, pages 154-163, 1994. IEEE Computer Society Press.