(Enter summary)
Abstract: A formulation of semantic theories for processes which is based on reduction relation
and equational reasoning is studied. The new construction can induce meaningful
theories for processes, both in strong and weak settings. The resulting theories
in many cases coincide with, and sometimes generalise, observation-based
formulation of behavioural equivalence. The basic construction of reduction-based
theories is studied, taking a simple name passing calculus called -calculus as an
example.... (Update)
Cited by: More
From Rewrite Rules to Bisimulation - Congruences Peter Sewell
(Correct)
Unknown -
(Correct)
Math. Struct. in Comp. Science (2003), vol. 13, pp.. - Cambridge University Press
(Correct)
Similar documents (at the sentence level):
17.6%: On Reduction-Based Process Semantics - Honda, YOSHIDA (1995)
(Correct)
Active bibliography (related documents): More All
0.4: Replication in Concurrent Combinators - Honda, Yoshida (1994)
(Correct)
0.2: Lazy Functions and Mobile Processes - Sangiorgi (1995)
(Correct)
0.1: Unknown - Moe Ffiw Rk
(Correct)
Similar documents based on text: More All
0.2: Combinatory Representation of Mobile Processes - Honda, Yoshida (1994)
(Correct)
0.2: safeDpi: a language for controlling mobile code - Hennessy, Rathke, Yoshida (2003)
(Correct)
0.1: A Process-Calculus Approach to Typed Concurrent Objects - Vasco Thudichum (1994)
(Correct)
Related documents from co-citation: More All
61: Information and Computation (context) - Milner, Parrow et al. - 1992
56: An object calculus for asynchronous communication
- Honda, Tokoro - 1991
50: Barbed bisimulation
- Milner, Sangiorgi - 1992
BibTeX entry: (Update)
Kohei Honda and Nobuko Yoshida. On reduction-based process semantics. Theoretical Computer Science, 1995. http://citeseer.ist.psu.edu/honda95reductionbased.html More
@article{ honda95reductionbased,
author = "Kohei Honda and Nobuko Yoshida",
title = "On reduction-based process semantics",
journal = "Theoretical Computer Science",
volume = "151",
number = "2",
pages = "437--486",
year = "1995",
url = "citeseer.ist.psu.edu/honda95reductionbased.html" }
Citations (may not include all citations):
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
502
Concurrency and Automata on Infinite Sequences (context) - Park - 1980
484
Calculus of Communicating Systems (context) - Milner - 1980
297
A Calculus of Mobile Processes (context) - Milner, Parrow et al. - 1989
294
An Object Calculus for Asynchronous Communication
- Honda, Tokoro - 1991
197
Barbed Bisimulation
- Milner, Sangiorgi - 1992
194
Functions as Processes (context) - Milner - 1990
168
Testing equivalences for processes (context) - De Nicola, Hennessy - 1984
62
A calculus of higher order communicating systems (context) - Thomsen - 1989
50
A Calculus of Communicating Systems with Label Passing
- Engberg, Nielsen - 1986
42
The Lazy Lambda Calculus: An Investigation into the Foundati.. (context) - Ong - 1988
39
A pi-calculus Semantics for an Object-Based Design Notation (context) - Jones - 1993
33
Asynchrony and ß-calculus (context) - Boudol - 1991
23
Logic and Algebra of Specification (context) - Milner, Polyadic - 1992
20
Research topics in Functional Programming (context) - Abramsky, The - 1990
16
Two bisimilarities in -calculus (context) - Honda - 1992
9
Set Theoretical Models of Lambda Calculus: Theory (context) - Longo - 1983
4
Annual Symposium on Principles of Programming Languages (context) - Honda, Yoshida - 1994
1
Annual Symposium on Principles of Programming Languages (context) - Berry, Boudol - 1990
The graph only includes citing articles where the year of publication is known.
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