SPIN 2002: Model Checking Software pp 128-147 | Cite as

Local Parallel Model Checking for the Alternation-Free μ-Calculus

  • Benedikt Bollig
  • Martin Leucker
  • Michael Weber
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2318)

Abstract

We describe the design of (several variants of) a local parallel model-checking algorithm for the alternation-free fragment of the μ-calculus. It exploits a characterisation of the problem for this fragment in terms of two-player games. For the corresponding winner, our algorithm determines in parallel a winning strategy, which may be employed for debugging the underlying system interactively, and is designed to run on a network of workstations. Depending on the variant, its complexity is linear or quadratic. A prototype implementation within the verification tool Truth shows promising results in practice.

Keywords

Model Check Transition System Parallel Algorithm Winning Strategy Label Transition System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. R. Andersen. Model checking and Boolean graphs. Theoretical Computer Science, 126(1):3–30, 11 Apr. 1994.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    S. Basonov. Parallel implementation of BDD on DSM systems. Master’s thesis, Computer Science Department, Technion, 1998.Google Scholar
  3. 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.Google Scholar
  4. 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.Google Scholar
  5. 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.CrossRefGoogle Scholar
  6. 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.Google Scholar
  7. 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.Google Scholar
  8. 8.
    E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.Google Scholar
  9. 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.CrossRefMathSciNetGoogle Scholar
  10. 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.MATHCrossRefGoogle Scholar
  11. 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.Google Scholar
  12. 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.Google Scholar
  13. 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.Google Scholar
  14. 14.
    D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, Dec. 1983.Google Scholar
  15. 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.CrossRefMathSciNetMATHGoogle Scholar
  16. 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.Google Scholar
  17. 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.Google Scholar
  18. 18.
    A. Mader. Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, Technische Universität München, 1996.Google Scholar
  19. 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.Google Scholar
  20. 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.Google Scholar
  21. 21.
    C. Stirling. Games for bisimulation and model checking, July 1996. Notes for Mathfit Workshop on finite model theory, University of Wales, Swansea,.Google Scholar
  22. 22.
    A. L. Stornetta. Implementation of an efficient parallel BDD package. Master’s thesis, University of California, Santa Barbara, 1995.Google Scholar
  23. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Benedikt Bollig
    • 1
  • Martin Leucker
    • 2
  • Michael Weber
    • 1
  1. 1.Lehrstuhl für Informatik II, RWTH AachenGermany
  2. 2.Dept. of Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations