Joachim Parrow  Home/Search
Context Related
Links: ACM | daimi.aau.dk/~bra8130/LO...SICS16.ps.Z sics.se/~joachim/trios.ps.Z it.kth.se/~joachim/trios.ps.gz 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: docs.uu.se/docs/...mobility.shtml (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A trio is a term ff : fi : fl : 0 in the polyadic ß-calculus. We show that restricted parallel composition of possibly replicated trios, where at most one contains a bound output prefix, is enough to obtain the expressive power of the full summation-free ß-calculus up to weak bisimulation equivalence. Therefore that fragment of the calculus is undecidable. 1 Introduction The ß-calculus [MPW92, Mil91] is a basic calculus for describing reactive processes, i.e., processes that continually... (Update)
Context of citations to this paper: More
.... which may be interpreted as a fragment of the # calculus) and the translation of the choice free synchronous # cal culus into trios [Par99]. Much more work has been done on the compilation of whole languages into process calculi, exploring both semantics and...
...x(y) cannot be known until after u(x) but even so we can still pre deploy P . Other authors have proposed weaker forms of fragmentation [8, 4] but in a theoretical setting, not for implementation. Location based calculi. The dominant paradigm in the research community is not...
Cited by: More
Decoding Choice Encodings - Nestmann, Pierce (1996) (Correct)
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
The Fusion Machine (Extended Abstract) - Gardner, Laneve, Wischik (Correct)
Active bibliography (related documents): More All
0.3: On Adaptable Support for Cooperative Work - Dam (Correct)
0.2: On the Decidability of Process Equivalences for the pi-calculus - Dam (1994) (Correct)
0.2: A Partition Refinement Algorithm for the pi-calculus - Pistore, Sangiorgi (Correct)
Similar documents based on text: More All
0.2: On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets - Jantzen (1997) (Correct)
0.1: On Twist-Closed Trios - Jantzen (1997) (Correct)
0.1: Solos in Concert - Laneve, Victor (1999) (Correct)
Related documents from co-citation: More All
7: Barbed bisimulation - Milner, Sangiorgi - 1992
7: The fusion calculus: Expressiveness and symmetry in mobile processes - Parrow, Victor - 1998
6: Pict: A programming language based on the pi-calculus - Pierce, Turner - 1997
BibTeX entry: (Update)
J. Parrow. Trios in concert. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, 1998. To appear. http://citeseer.ist.psu.edu/172169.html More
@inproceedings{ parrowdidtrios,
author = "Joachim Parrow",
title = "Trios in Concert",
pages = "621--637",
url = "citeseer.ist.psu.edu/172169.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989 ACM
297 A calculus of mobile processes (context) - Milner, Parrow et al. - 1992
266 Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland - 1990
194 Functions as processes (context) - Milner - 1992 ACM DBLP
89 The Lambda Calculus (context) - Barendregt - 1984
70 On asynchronous communication semantics - Honda, Tokoro - 1992
48 Higher-level synchronising devices in MEIJE-SCCS (context) - de Simone - 1985
28 An algebraic verification of a mobile network - Orava, Parrow - 1992 DBLP
18 Future Generation Computer Systems - Parrow, power - 1990
15 Journal of Information and Computation (context) - Walker, the - 1995
13 calculus to Higher-Order ß-calculus --- and back (context) - Sangiorgi - 1993
7 Earlier version published as Report ECS-LFCS-93-270 (context) - Sangiorgi, of et al. - 1996
6 the Formal Analysis of Telecommunication Protocols (context) - Orava - 1994
6 Revised version of Technical Report ECS--LFCS (context) - Sangiorgi, bisimulation - 1994
5 the decidability of process equivalences for the ß- calculus (context) - Dam - 1995
1 Algebraic calculi of processes and net expressions (context) - Gonthier - 1985
The graph only includes citing articles where the year of publication is known.
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