Skip to main content
SpringerLink
Log in

Partial-order reduction in the weak modal mu-calculus

  • Invited Talks
  • Conference paper
  • First Online:
CONCUR '97: Concurrency Theory (CONCUR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1243))

Included in the following conference series:

Abstract

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that partial-order reduction can be highly effective in combating state explosion in modal mu-calculus model checking.

Research supported in part by NSF grants CCR-9505562, and AFOSR grants F49620-95-1-0508 and F49620-96-1-0087.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and T. A. Henzinger, editors. Computer Aided Verification (CAV '96), volume 1102 of Lecture Notes in Computer Science, New Brunswick, New Jersey, July 1996. Springer-Verlag.

    Google Scholar 

  2. G. S. Bhat and R. Cleaveland. Efficient model checking via the equational μ-calculus. In Clarke [Cla96], pages 304–312.

    Google Scholar 

  3. J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information and Computation, 60:109–137, 1984.

    Google Scholar 

  4. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer-Verlag, 1981.

    Google Scholar 

  5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.

    Google Scholar 

  6. R. Cleaveland, M. Klein, and B. Steffen. Faster model checking for the modal mu-calculus. In G.v. Bochmann and D.K. Probst, editors, Computer Aided Verification (CAV '92), volume 663 of Lecture Notes in Computer Science, pages 410–422, Montréal, June/July 1992. Springer-Verlag.

    Google Scholar 

  7. E. M. Clarke, editor. 11th Annual Symposium on Logic in Computer Science (LICS '96), New Brunswick, NJ, July 1996. Computer Society Press.

    Google Scholar 

  8. R. Cleaveland, P. M. Lewis, S. A. Smolka, and O. Sokolsky. The Concurrency Factory: A development environment for concurrent systems. In Alur and Henzinger [AH96], pages 398–401.

    Google Scholar 

  9. C. Courcoubetis, editor. Computer Aided Verification (CAV '93), volume 693 of Lecture Notes in Computer Science, Elounda, Greece, June 1993. Springer-Verlag.

    Google Scholar 

  10. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4), December 1996.

    Google Scholar 

  11. R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458–487, March 1995.

    Google Scholar 

  12. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the prepositional mu-calculus. In Proceedings of the First Annual Symposium on Logic in Computer Science, pages 267–278, 1986.

    Google Scholar 

  13. R. Gerth, R. Kuiper, W. Penczek, and D. Peled. A partial order approach to branching time model checking. Information and Computation, 1997.

    Google Scholar 

  14. P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2:149–164, 1993.

    Article  Google Scholar 

  15. P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305–326, May 1994.

    Google Scholar 

  16. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.

    Article  Google Scholar 

  17. X. Liu. Specification and Decomposition in Concurrency, Technical Report No. R 92-2005. PhD thesis, Department of Computer Science, Aalborg University, 1992.

    Google Scholar 

  18. D. Peled. Combining partial order reductions with on-the-fly model-checking. Formal Methods in System Design, 8(1):39–64, January 1996.

    Google Scholar 

  19. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.

    Google Scholar 

  20. O. Sokolsky. Efficient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus. PhD thesis, Department of Computer Science, SUNY at Stony Brook, April 1996.

    Google Scholar 

  21. C. Stirling. Modal and temporal logics. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science. Oxford University Press, 1992.

    Google Scholar 

  22. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1), 1991.

    Google Scholar 

  23. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1:146–160, 1972.

    Google Scholar 

  24. A. Valmari. Error detection by reduced reachability graph detection. In Proc. 9th European Workshop on Application and Theory of Petri Nets, pages 95–112, Vencie, 1988.

    Google Scholar 

  25. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1(4):297–322, December 1992.

    Google Scholar 

  26. A. Valmari. On-the-fly verification with stubborn sets. In Courcoubetis [Cou93], pages 397–408.

    Google Scholar 

  27. B. Vergauwen and J. Lewi. Efficient local correctness checking for single and alternating boolean equation systems. In Proceedings of ICALP'94, pages 304–315. LNCS 820, 1994.

    Google Scholar 

  28. B. Willems and P. Wolper. Partial-order methods for model checking: From linear time to branching time. In Clarke [Cla96].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY at Stony Brook, 11794-4400, Stony Brook, NY, USA

    Y. S. Ramakrishna & Scott A. Smolka

Authors
  1. Y. S. Ramakrishna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Scott A. Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramakrishna, Y.S., Smolka, S.A. (1997). Partial-order reduction in the weak modal mu-calculus. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63141-5

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation