(Enter summary)
Abstract: . We develop a theory of structured objects and their relational manipulation as a
basis of theories of processes in which connection and interaction among computing agents
at multiple interface points are the fundamental elements. Starting from a simple algebraic
scheme for "processes with (port) names" as found in usual process calculi, an analysis of an
internal structure of name-based processes leads to a leaner, but equivalent, presentation of
processes, which is more geometricand which... (Update)
Context of citations to this paper: More
.... by X includes inaction (b) and it is closed under structural rules (a) reduction contexts (c e) and renaming operators (f) cf. [10, 24]) 3 . ii) says that if X is a basis then any term should be behaviourally equivalent to some term generated by X . iii) means a...
.... X includes structural rules (a) and inaction (b) and it is closed under reduction contexts (c e) and renaming operators (f) cf. [14, 15, 40]) 5 . iii) means a system P should be closed under generation and reduction. In (iv) Y 1 Y 2 means two systems generated by Y 1 and...
Cited by: More
Bigraphical Reactive Systems: Basic Theory - Milner (2001)
(Correct)
Elementary Structures in Process Theory (1) Sets with Renaming - Honda (1997)
(Correct)
Graph Types For Monadic Mobile Processes - Yoshida (1996)
(Correct)
Similar documents (at the sentence level):
8.2%: Notes on P-Algebra (1): Process Structures - Honda (1995)
(Correct)
Active bibliography (related documents): More All
0.9: Notes on P-Algebra (4): Algebra over Process Structure, Part I. - Honda
(Correct)
0.8: Notes On Undirected Actions - Kohei Honda (1997)
(Correct)
0.6: A Theory of Types for π-Calculus - Honda (1998)
(Correct)
Similar documents based on text: More All
0.1: Modeling Sharing and Recursion for Weak Reduction.. - Benaissa, Lescanne, Rose (1996)
(Correct)
0.1: A Cantor-Bernstein Result for Structured Objects - Joost Engelfriet (1996)
(Correct)
0.1: Operational Reduction Models for Functional Programming Languages - Rose (1996)
(Correct)
Related documents from co-citation: More All
6: Replication in Concurrent Combinators
- Honda, Yoshida - 1994
6: Information and Computation (context) - Walker, the - 1995
6: An object calculus for asynchronous communication
- Honda, Tokoro - 1991
BibTeX entry: (Update)
Honda, K., Notes on P-Algebra (1): Process Structure. Proc. TPPP'94, LNCS 907, pp.25--44, Springer-Verlag, 1995. http://citeseer.ist.psu.edu/article/honda97process.html More
@misc{ honda95process,
author = "K. Honda",
title = "Process Structure",
text = "Honda, K., Notes on P-Algebra (1): Process Structure. Proc. TPPP'94, LNCS
907, pp.25--44, Springer-Verlag, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/article/honda97process.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985
1933
Communication and Concurrency (context) - Milner - 1989
982
Theoretical Computer Science (context) - Girard - 1987
854
Information and Computation (context) - Milner, Parrow et al. - 1992
484
A Calculus of Communicating Systems (context) - Milner - 1980
359
Introduction to higher order categorical logic (context) - Lambek, Scott - 1986
299
Conditional Rewriting Logic as a Unified Model of Concurrenc.. (context) - Meseguer - 1992
254
Theoretical Computer Science (context) - Berry, Boudol - 1992
248
Expressing Mobility (context) - Sangiorgi - 1992
197
Barbed Bisimulation
- Milner, Sangiorgi - 1992
146
Typing and subtyping for mobile processes
- Pierce, Sangiorgi - 1993
140
On Reduction-Based Process Semantics
- Honda, Yoshida - 1995
127
Information and Computation (context) - Walker - 1995
109
Interaction Nets (context) - Lafont - 1990
97
Mathematical Structure in Computer Science (context) - Milner - 1992
97
North Holland (context) - Freyd - 1990
89
Calculi for Interaction
- Milner
88
Linear Logic: its syntax and semantics
- Girard
83
Sheaves in Geometry and Logic (context) - Lane, Moerdijk - 1992
75
The Geometry of Optimal Lambda Reduction
- Gonthier, Abadi et al. - 1992
70
An Algorithm for Optimal Lambda Calculus Reduction (context) - Lamping - 1990
69
Geometry of Interaction I: interpretation of System F (context) - Girard - 1989
67
Composing Processes
- Honda - 1996
40
Proof Nets: Parallel Syntax for Proof-Theory (context) - Girard - 1996
35
Combinatory Representation of Mobile Processes
- Honda, Yoshida - 1994
30
Computer Science Department (context) - Milner, Action - 1992
24
Geometry of Interaction II: deadlock free algorithms (context) - Girard - 1989
23
Logic and Algebra of Specification (context) - Milner, Polyadic - 1993
23
Handbook of Logic in Computer Science (context) - Winskel, Nielsen - 1995
22
Replication in Concurrent Combinators
- Honda, Yoshida - 1994
22
Department of Computer Science (context) - Stark, Names - 1995
22
Graph Notation for Concurrent Combinators
- Yoshida
21
Flowgraphs and Flow Algebras (context) - Milner - 1979
15
Synchronization Trees (context) - Winskel - 1985
14
University of Edinburgh (context) - Mifsud, Control - 1996
14
A name free account of action calculi (context) - Gardner
12
Department of Computer Science (context) - Honda, on - 1995
10
London Mathematical Society Lecture Notes Series (context) - Girard, Lafont et al. - 1995
7
an analysis of Girard's execution formula (context) - Danos, Regnier - 1993
7
Combinatory Formulations of Concurrent Languages (context) - Raja, Shyamasundar - 1995
7
Interaction Diagrams
- Parrow - 1993
6
Pi-nets: a graphical form of pi-calculus (context) - Milner - 1994
6
Term Declaration Logic and Generalised Composita
- Aczel - 1991
6
Oxford University Press (context) - McLarty - 1992
6
Group Presentation of Process Structure (context) - Honda - 1995
6
Transactions of the American Mathematical Society (context) - Nerode - 1959
5
Algebraic Theory of Processes (context) - Hennesy - 1989
5
Replacement Systems and the axiomatisation of Situation Theo.. (context) - Aczel - 1990
3
IEEE Computer Society (context) - Mifsud, Milner et al. - 1995
3
Control Structures II: Naming Monoids (context) - Milner - 1995
3
Cambridge Tracts in Theoretical Computer Science (context) - Baeton, Wejland - 1990
2
Lisp and Function (context) - Bawden - 1984
2
Reversible and Irreversible Computations (context) - Danos, Regnier - 1996
2
Geometry of Interaction III: Accomodating the Additives (context) - Girard
2
From Interaction Nets to Proof Nets (context) - Lafont
1
ators, to appear in Information and Computation (context) - Lafont
1
Comparing the Expressive Power of the Synchronousand the Asy.. (context) - Catuscia - 1997
1
IEEE Computer Society Press (context) - Asperti, Danos et al. - 1994
1
Abstract Process Structures (context) - Honda - 1996
1
persional communitation (context) - Sangiorgi - 1996
1
Coroutines and networks of parallel processes Information Pr.. (context) - Kahn, MacQueen - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.di.fc.ul.pt/~vv/mobilebib.html): More
An Algebraic Verification of a Mobile Network - Orava (1991)
(Correct)
Calculi for Interaction - Robin Milner (1996)
(Correct)
Action Structures and the Pi Calculus - Milner
(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