Partial-order reduction in the weak modal mu-calculus

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

Volumn 1243, Issue , 1997, Pages 5-24

  Ramakrishna, Y S ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957880016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_2     Document Type: Conference Paper

References (28)

1. R. Alur and T. A. Henzinger, editors. Computer Aided Verification (CAV '96), volume 1102 of Lecture Notea in Computer Science, New Brunswick, New Jersey, July 1996. Springer-Verlag.
2. G. S. Bhat and R. Cleaveland. Efficient model checking via the equational μ-calculus. In Clarke [Cla96], pages 304-312.
3. J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information and Computation, 60:109-137, 1984.
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 Note8 in Computer Science, pages 52-71. Springer-Verlag, 1981.
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.
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.
7. E. M. Clarke, editor. 11th Annual Symposium on Logic in Computer Science (LICS '96), New Brunswick, NJ, July 1996. Computer Society Press.
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.
9. C. Courcoubetis, editor. Computer Aided Verification (CA V '93), volume 693 of Lecture Notes in Computer Science, Elotmda, Greece, June 1993. Springer-Verlag.
10. E.M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4), December 1996.
11. R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, March 1995.
12. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the First Annual Symposium on Logic in Computer Science, pages 267-278, 1986.
13. R. Gerth, R. Kuiper, W. Penczck, and D. Peled. A partial order approach to branching time model checking. Information and Computation, 1997.
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.
15. P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305-326, May 1994.
16. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
17. X. Liu. Specification and Decomposition in Concurrency, Technical Report No. R 92-2005. PhD thesis, Department of Computer Science, Aalborg University, 1992.
18. D. Peled. Combining partial order reductions with on-the-fly model-checking. Formal Methods in System Design, 8(1):39-64, January 1996.
19. J.P. Queille and J. Sifalds. 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.
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.
21. C. Stirling. Modal and temporal logics. In S. Abramsky, D. Gahbay, and T. Maibaum, editors, Handbook of Logic in Computer Science. Oxford University Press, 1992.
22. C. Stirring and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1), 1991.
23. R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1:146-160, 1972.
24. A. Valmari. Error detection by reduced reachahility graph detection. In Proc. 9th European Workshop on Application and Theory of Petri Nets, pages 95-112, Vencie, 1988.
25. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1(4):297-322, December 1992.
26. A. Valmari. On-the-fly verification with stubborn sets. In Courcoubetis [Cou93], pages 397-408.
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.
28. B. Willems and P. Wolper. Partial-order methods for model checking: From linear time to branching time. In Clarke [Cla96].