(Enter summary)
Abstract: We present a methodology for checking bisimilarities between pi-calculus processes with the up-to techniques for bisimulation. These techniques are used to reduce the size of the relation one has to exhibit to prove a bisimulation. Not only is this interesting in terms of space management, but it also increases dramatically the expressive power of our system, by making in some cases the verication of innite states space processes possible. Based on an algorithm to compute a unique normal form... (Update)
Cited by: More
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001)
(Correct)
Similar documents (at the sentence level):
18.4%: Pre-proceedings: MFCS'98 Workshop on Concurrency August.. - Jancar, (eds.) (1998)
(Correct)
14.6%: Automatically Proving Up-to Bisimulation - Hirschkoff (1998)
(Correct)
Active bibliography (related documents): More All
0.5: An Interpretation of Typed Concurrent Objects in the Blue Calculus - Dal-Zilio (1999)
(Correct)
0.5: Formalizing Convex Hulls Algorithms - Pichardie, Bertot (2001)
(Correct)
0.1: The Fusion Calculus: Expressiveness and Symmetry in Mobile.. - Parrow, Victor (1997)
(Correct)
Similar documents based on text: More All
0.4: Interaction de formalismes logiques et algébriques.. - Azema, Bahsoun.. (1997)
(Correct)
0.4: A Full Formalisation of π-Calculus Theory in the Calculus of .. - Hirschkoff (1997)
(Correct)
0.3: Composition Symbolique - Correnson, Duris, Parigot, Roussel (1997)
(Correct)
Related documents from co-citation: More All
3: ACM. 26th Annual Symposium on Principles of Programming Languages (POPL) (San Antonio, TX), 1999.
2: The fusion calculus: Expressiveness and symmetry in mobile processes
- Parrow, Victor - 1998
BibTeX entry: (Update)
Daniel Hirschko. Automatically proving up to bisimulation. In Petr Jancar and Mojmir Kretinsky, editors, Proceedings of MFCS '98 Workshop on Concurrency, volume 18 of Electronic Notes in Theoretical Computer Science (ENTCS). Elsevier Science Publishers, 1998. http://citeseer.ist.psu.edu/hirschkoff98automatically.html More
@inproceedings{ hirschkoffhirschkoffautomatically,
author = "Daniel Hirschkoff",
title = "Automatically Proving Up to Bisimulation",
url = "citeseer.ist.psu.edu/hirschkoff98automatically.html" }
Citations (may not include all citations):
61
The fusion calculus: Expressiveness and symmetry in mobile p..
- Parrow, Victor - 1998 DBLP
48
Higher-level synchronising devices in Meije-SCCS (context) - De Simone - 1985 DBLP
40
Three partition renement algorithms (context) - Paige, Tarjan - 1987
25
An interpretation of typed objects into typed - calculus (context) - Sangiorgi - 1996
22
Bisimulation in name-passing calculi without matching (context) - Boreale, Sangiorgi - 1998 ACM DBLP
22
Bisimilarity of open terms
- Rensink - 1997 ACM DBLP
21
The Mobility Workbench a tool for the -calculus (context) - Victor, Moller - 1994
19
good' encoding of guarded choice (context) - Nestmann
7
Earlier version published as Report ECS-LFCS-93-270 (context) - Sangiorgi, of et al. - 1996
2
demo presentation at TACAS (context) - Bouali, Ressouche et al. - 1996
2
Using reAEection to build eOEcient and certied decision proc.. (context) - Boutin - 1997
2
Techniques of iweak bisimulation up toj (context) - Sangiorgi, Milner - 1992
2
The integration project in the JACK Environement
- Bouali, Larosa et al. - 1994
1
A partition renement algorithm for the -calculus (context) - Pistore, Sangiorgi - 1996
1
aldebaran development package) : A protocol validation and v.. (context) - Kerbrat, Mateescu et al. - 1996
1
A full formalisation of -calculus theory in the Calculus of .. (context) - Hirschkooe - 1997
1
Multisets and structural congruence of the -calculus with re.. (context) - Engelfriet, Gelsema - 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC