Nobuko Yoshida  Home/Search
Context Related
Links: ACM DBLP | dcs.ed.ac.uk/export/ny/ccgraph.ps.gz mcs.le.ac.uk/~nyoshida/...ccgraph.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: dcs.ed.ac.uk/home/ny/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We introduce graph notation for concurrent processes which does not use the notion of port names for its formulation. The operators in the algebra of graphs proposed in this paper are quite different from those in the original term representation, making such notions as connection and correspondence of communication ports explicit. We show how basic elements of process calculi such as agents, reduction, and behavioural equivalences are soundly formulated in the new setting. The work is based... (Update)
Context of citations to this paper: More
...at the bottom of the proofs are not mirrored. Also, no correspondence between proof nets and calculus graphs is provided. Yoshida in [18] discusses the relationship between processes and a general framework for proof nets, the so called Interaction Nets [8] The analogy...
.... without choice and matching, already introduced in [12] Di erent ways of encoding the calculus into graph rewriting can be found in [21, 5, 4]. We apply the theory presented in section 3, introduce a type system avoiding runtime errors produced by mismatching arities and...
Cited by: More
Description and Verification of Mobile Processes with Graph.. - König (Correct)
Observational Equivalence for Synchronized Graph Rewriting.. - König, Montanari (2001) (Correct)
Solo Diagrams - Laneve, Parrow, Victor (2001) (Correct)
Active bibliography (related documents): More All
0.7: Graph Types For Monadic Mobile Processes - Yoshida (1996) (Correct)
0.5: Interaction Diagrams - Parrow (1994) (Correct)
0.4: On Reduction-Based Process Semantics - Honda, YOSHIDA (1995) (Correct)
Similar documents based on text: More All
0.5: Replication in Concurrent Combinators - Honda, Yoshida (1994) (Correct)
0.5: Unknown - Moe Ffiw Rk (Correct)
0.1: Combinatory Representation of Mobile Processes - Honda, Yoshida (1994) (Correct)
Related documents from co-citation: More All
10: Interaction Nets (context) - Lafont - 1990
9: Barbed bisimulation - Milner, Sangiorgi - 1992
9: Information and Computation (context) - Milner, Parrow et al. - 1992
BibTeX entry: (Update)
Yoshida, N., Graph Notation for Concurrent Combinators, Proc. TPPP'94, LNCS 907, pp.393--412, Springer-Verlag, 1995. http://citeseer.ist.psu.edu/yoshida95graph.html More
@inproceedings{ yoshida95graph,
author = "Nobuko Yoshida",
title = "Graph Notation for Concurrent Combinators",
booktitle = "Theory and Practice of Parallel Programming ({TPPP}), Sendai, Japan (Nov.{} 1994)",
number = "907",
publisher = "Springer-Verlag",
editor = "Takayasu Ito and Akinori Yonezawa",
year = "1995",
url = "citeseer.ist.psu.edu/yoshida95graph.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
854 Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
484 A Calculus of Communicating Systems (context) - Milner - 1980
254 Theoretical Computer Science (context) - Berry, Boudol - 1992
197 Barbed Bisimulation - Milner, Sangiorgi - 1992 ACM DBLP
140 On Reduction-Based Process Semantics - Honda, Yoshida - 1993 ACM DBLP
109 Interaction Nets (context) - Lafont - 1990
97 Mathematical Structure in Computer Science (context) - Milner - 1992
75 The Geometry of Optimal Lambda Reduction - Gonthier, Abadi et al. - 1992
62 A calculus of higher order communicating systems (context) - Thomsen - 1989 ACM DBLP
47 Department of Computer Science (context) - Milner, Action - 1993
35 Combinatory Representation of Mobile Processes - Honda, Yoshida - 1994 ACM DBLP
23 Logic and Algebra of Specification (context) - Milner - 1992 ACM
22 A Theory of Bisimulation for the ß-calculus (context) - Sangiorgi - 1992
22 Replication in Concurrent Combinators - Honda, Yoshida - 1994 ACM DBLP
21 Flowgraphs and Flow Algebras (context) - Milner - 1979 ACM DBLP
19 Process-Algebraic Foundations for an Object-Based Design Not.. (context) - Jones - 1993
8 Combinators for Interaction Nets - Gay - 1994
7 Interaction Diagrams - Parrow - 1993
3 A Study of -calculus and its Combinatory Representation (context) - Honda - 1994
2 nets with boxes and replication (context) - Milner, Notes - 1993
1 Nameless Concurrent Combinators (context) - Honda, Yoshida - 1994
1 The Next 700 Combinatory Representations of Mobile Processes (context) - Raja, Shymasundar - 1994
1 the early version of this paper (context) - Honda, Yoshida - 1994
1 Algebra 1: Process Structure (context) - Honda
1 Diploma in Computer Science in Queens (context) - Gay - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcs.ed.ac.uk/home/ny/): More
On Reduction-Based Process Semantics - Honda, Yoshida (1995) (Correct)
Game Theoretic Analysis Of Call-By-Value Computation - Kohei Honda (1997) (Correct)
Minimality and Separation Results on Asynchronous Mobile.. - Yoshida (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