State space reduction using partial τ-confluence

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

Volumn 1893, Issue , 2000, Pages 383-393

  Groote, Jan Friso ^a,b   van de Pol, Jaco ^a  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BRANCHING BISIMULATION; LABELLED TRANSITION SYSTEMS; STATE-SPACE REDUCTION;

ALGORITHMS;

EID: 84959199941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_34     Document Type: Conference Paper

References (21)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman. Data structures and algorithms. Addison-Wesley. 1983.
2. M.A. Bezem and J.F. Groote. A correctness proof of a one bit sliding window protocol in μCRL. The Computer Journal, 37(4): 289-307, 1994.
3. M. Cherif and H. Garavel and H. Hermanns. The bcg min user manual, version 1.1. http://www.inrialpes.fr/vasy/cadp/man/bcg min.html, 1999.
4. D. Dill, C.N. Ip and U. Stern. Murphi description language and verifier. http://sprout.stanford.edu/dill/murphi.html, 1992-2000.
5. H. Garavel and R. Mateescu. The Caesar/Aldebaran development package. http://www.inrialpes.fr/vasy/cadp/, 1996-2000.
6. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. In Journal of the ACM, 43(3):555-600, 1996.
7. P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305-326, 1994.
8. J.F. Groote and B. Lisser. The_CRL toolset. http://www.cwi.nl/~mcrl, 1999-2000.
9. J.F. Groote and J.C. van de Pol. State space reduction using partial τ -confluence. Technical Report CWI-SEN-R0008, March 2000. Available via http://www.cwi.nl/~vdpol/papers/.
10. J.F. Groote and M.P.A. Sellink. Confluence for process verification. In Theoretical Computer Science B, 170(1-2):47-81, 1996.
11. J.F. Groote and F.W. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proc. 17th ICALP, LNCS 443, 626-638. Springer-Verlag, 1990.
12. P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, 1990.
13. N. Kobayashi, B.C. Pierce, and D.N. Turner. Linearity and the π-calculus. In: Proceedings of the 23rd POPL, pages 358-371. ACM press, January 1996.
14. X. Liu and D. Walker. Confluence of processes and systems of objects. In Proceedings of TAPSOFT'95, pages 217-231, LNCS 915, 1995.
15. S.P. Luttik. Description and formal specification of the link layer of P1394. Technical Report SEN-R9706, CWI, Amsterdam, 1997.
16. R. Milner. Communication and Concurrency. Prentice Hall International. 1989.
17. U. Nestmann and M. Steffen. Typing confluence. In: Proceedings of FMICS'97, pages 77-101. CNR Pisa, 1997.
18. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
19. A. Philippou and D. Walker. On confluence in the pi-calculus. 24th Int. Coll. on Automata, Languages and Programming, LNCS 1256, Springer-Verlag, 1997.
20. M. Sighireanu and R. Mateescu. Verification of the link layer protocol of the IEEE-1394 serial bus (firewire): an experiment with E-LOTOS. In Journal on Software Tools for Technology Transfer (STTT), 2(1):68-88, 1998.
21. A. Valmari. A stubborn attack on state explosion. In Proc. of Computer Aided Verification, LNCS 531, pages 25-42, Springer-Verlag, 1990.