On the benefits of using the up-to techniques for bisimulation verification

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

Volumn 1579, Issue , 1999, Pages 285-299

  Hirschkoff, Daniel ^a  

^a UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

AUTOMATIC VERIFICATION; BISIMULATION CHECKING; BISIMULATIONS; COMPUTATIONAL COMPLETENESS; EXPRESSIVE POWER; INFINITE STATE SPACE; PARALLEL COMPOSITION; STRUCTURAL CONGRUENCES;

CALCULATIONS;

EID: 84948963777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49059-0_20     Document Type: Conference Paper

References (12)

1. FM91. J.-C. Fernandez and L. Mounier. "On the fly" verification of behavioural equivalences and preorders. In Proceedings of CAV'91, LNCS, 1991.
2. Hir98. D. Hirschkoff. Automatically Proving Up To Bisimulation. In Proceedings of MFCS'98 Workshop on Concurrency, volume 18 of ENTCS, 1998.
3. Mam98. B. Mammas. Une mtéthodologie de preuves orientée contraintes et basée sur les systémes de transitions modales. Technical report, LIP6, UPMC, 1998.
4. Mil91. R. MiIner. The polyadic α-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, October 1991.
5. Nes97. U. Nestmann. What is a 'good' encoding of guarded choice? In Proceedings of EXPRESS'97, volume 7 of ENTCS, 1997.
6. NP96. U. Nestmann and B. C. Pierce. Decoding choice encodings. In Proceedings of CONCUR '96, number 1119. LNCS, Springer Verlag, August 1996.
7. PT87. R. Paige and R. E. Tarjan. Three partition rénement algorithms. SIAM Journal on Computing, 16(6): 973-989, 1987.
8. PT97. B. C. Pierce and D. N. Turner. Pict: A Programming Language Based on the Pi-Calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997.
9. San95. D. Sangiorgi. On the bisimulation proof method. In Proceedings of MFCS '95, volume 969 of LNCS, 1995.
10. San96. D. Sangiorgi. A theory of bisimulation for the α-calculus. Acta Informatica, 33: 69-97, 1996.
11. San97. D. Sangiorgi. The name discipline of uniform receptiveness. In Proceedings of ICALP '97, volume 1256 of LNCS, pages 303-313, 1997.
12. VM94. B. Victor and F. Moller. The MobilityWorkbench; a tool for the α-calculus. In D. Dill, editor, Proceedings of CAV'94, volume 818 of LNCS, pages 428-440. Springer-Verlag, 1994.