Mads Dam  Home/Search
Context
Related
| daimi.aau.dk/~bra8130/LOM...SICS1.ps.Z sics.se/pub/SICSr...R9420SE.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.aau.dk/~b...OMAPS_abstracts (more) From: sics.se/libabstracts (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present general results for showing process equivalences applied to the finite control fragment of the ß-calculus decidable. Firstly a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Secondly a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen large enough, but finite. We show how these results lead to decidability for a number of... (Update)
Similar documents (at the sentence level):
13.5%: Model Checking Mobile Processes - Dam (1993) (Correct)
Active bibliography (related documents): More All
0.2: Trios in Concert - Parrow (1998) (Correct)
0.2: An Analysis of pi-calculus Bisimulations - Amadio, Ait-Mohamed (1995) (Correct)
0.2: Toward a Modal Theory of Types for the Pi-Calculus - Amadio, Dam (1996) (Correct)
Similar documents based on text: More All
0.4: An Implementation of an Efficient Algorithm for Bisimulation.. - Fernandez (1989) (Correct)
0.3: "On-The-Fly Instantiation" of Value-Passing Processes - Lin (Correct)
0.2: Unique Fixpoint Induction for Mobile Processes - Lin (1995) (Correct)
BibTeX entry: (Update)
@article{ dam97decidability,
author = "Mads Dam",
title = "On the decidability of process equivalences for the pi--- calculus",
journal = "Theoretical Computer Science",
volume = "183",
number = "2",
pages = "215--228",
year = "1997",
url = "citeseer.ist.psu.edu/dam94decidability.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992
216 Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
201 Three partition refinement algorithms (context) - Paige, Tarjan - 1987
137 Laboratory for the Foundations of Computer Science (context) - Milner, ss-calculus et al. - 1991
136 Information and Computation (context) - Kannellakis, Smolka et al. - 1990
127 Information and Computation (context) - Walker, the - 1994
102 Bisimulation equivalence is decidable for all context-free p.. - Christensen, Huttel et al. - 1992
97 Mathematical Structures in Computer Science (context) - Milner, processes - 1992
32 Deciding bisimulation equivalences for a class of non-finite.. - Jonsson, Parrow - 1992
28 Symbolic bisimulations (context) - Hennessy, Lin - 1992
28 An algebraic verification of a mobile network - Orava, Parrow - 1992
22 A theory of bisimulation for the ß-calculus (context) - Sangiorgi - 1993
13 calculus to higher-order ß-calculus---and back (context) - Sangiorgi - 1993
6 Graphes canoniques des graphes alg'ebriques (context) - Caucal - 1990
6 A uniform presentation of CHOCS and ß-calculus (context) - Amadio - 1992
6 the Formal Analysis of Telecommunication Protocols (context) - Orava - 1994
1 A fast algorithm for deciding bisimilarity of normed context.. (context) - Hirschfeld, Moller - 1994
Documents on the same site (http://www.daimi.aau.dk/~bra8130/LOMAPS_abstracts.html): More
Enhanced Operational Semantics - Degano, Priami (1996) (Correct)
Clock Analysis of Synchronous Dataflow Programs - Jensen (1995) (Correct)
Proving Properties of Dynamic Process Networks - Dam (1998) (Correct)
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