(Enter summary)
Abstract: We develop an elementary theory of process structure, a mathematical object which
is intended to capture a basic aspect of concurrent processes in a simple way. It
has two kinds of presentations: one underlies many extant process theories and
another has a more geometric flavour. We prove these are essentially equivalent.
The theory forms a basis of P-algebra, a general semantic structure for concurrent
processes.
1 Introduction
The aim of the present notes is to develop an elementary theory... (Update)
Similar documents (at the sentence level):
16.8%: Process Structures - Honda (1997)
(Correct)
6.5%: Elementary Structures in Process Theory (1) Sets with Renaming - Honda (1997)
(Correct)
Active bibliography (related documents): More All
0.5: Deliverables: A Categorical Approach to Program Development in.. - McKinna (1992)
(Correct)
0.2: Notes on P-Algebra (4): Algebra over Process Structure, Part I. - Honda
(Correct)
0.2: A Theory of Types for π-Calculus - Honda (1998)
(Correct)
Similar documents based on text: More All
0.9: Intra-Modular Structuring in Model-Oriented Specification.. - Bicarregui (1995)
(Correct)
0.2: Notes on P-Algebra (2): Group Presentation of Process Structure - Honda (1992)
(Correct)
0.2: Notes on P-Algebra (3): Cartesian Product of Process Structures - Honda (1995)
(Correct)
BibTeX entry: (Update)
@inproceedings{ honda94notes,
author = "Kohei Honda",
title = "Notes on P-Algebra 1: Process Structure",
booktitle = "Theory and Practice of Parallel Programming",
pages = "25-44",
year = "1994",
url = "citeseer.ist.psu.edu/honda95note.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
299
Conditional Rewriting Logic as a Unified Model of Concurrenc.. (context) - Meseguer - 1992
254
Theoretical Computer Science (context) - Berry, Boudol - 1992
109
Interaction Nets (context) - Lafont - 1990
97
Mathematical Structure in Computer Science (context) - Milner - 1992
65
Universal Algebra (context) - Cohn - 1981
35
Combinatory Representation of Mobile Processes
- Honda, Yoshida - 1994
30
Computer Science Department (context) - Milner, Action - 1992
22
Replication in Concurrent Combinators
- Honda, Yoshida - 1994
22
Graph Notation for Concurrent Combinators
- Yoshida - 1995
5
Theory and Formal Methods (context) - Abramsky - 1993
2
Categories and Allegories (context) - Freyd, Scedrov - 1990
1
The full version to appear in Theoretical Computer Science (context) - Honda, Yoshida - 1993
Documents on the same site (http://www.dcs.qmw.ac.uk/~kohei/): More
An Interaction-based Language and its Typing System - Takeuchi (1994)
(Correct)
A Theory of Types for π-Calculus - Honda (1998)
(Correct)
Composing Processes - Honda (1996)
(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