Kohei Honda, Nobuko YOSHIDA  Home/Search
Context Related
| dcs.ed.ac.uk/export/koh...redsem.ps.gz dcs.qmw.ac.uk/lfp/kohei...redsem.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: cs.auc.dk/mobility/bib/honda (more) From: dcs.qmw.ac.uk/~kohei/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A formulation of semantic theories for processes which does not rely on the notion of observables or convergence, is studied. The new construction is based solely on a reduction relation and equational reasoning, but can induce meaningful theories for processes, both in weak and strong 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,... (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):
7.4%: On Reduction-Based Process Semantics - Honda, Yoshida (1995) (Correct)
Active bibliography (related documents): More All
0.4: Graph Types For Monadic Mobile Processes - Yoshida (1996) (Correct)
0.4: Graph Notation For Concurrent Combinators - Yoshida (1995) (Correct)
0.3: Replication in Concurrent Combinators - Honda, Yoshida (1994) (Correct)
Similar documents based on text: More All
1.2: Unknown - Moe Ffiw Rk (Correct)
0.4: A Compositional Logic for Polymorphic Higher-Order Functions - Kohei Honda Department (2004) (Correct)
0.4: Genericity and the π-Calculus - Berger, Honda, Yoshida (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/article/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/article/honda95reductionbased.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
854 Information and Computation (context) - Milner, Parrow et al. - 1992
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
294 An Object Calculus for Asynchronous Communication - Honda, Tokoro - 1991
254 Theoretical Computer Science (context) - Berry, Boudol - 1992
197 Barbed Bisimulation - Milner, Sangiorgi - 1992
168 Testing equivalences for processes (context) - De Nicola, Hennessy - 1984
149 Calculus: a tutorial (context) - Milner - 1992
97 Mathematical Structure in Computer Science (context) - Milner - 1992
63 Optimal reductions in the lambda-calculus (context) - L'evy - 1980
62 A calculus of higher order communicating systems (context) - Thomsen - 1989
50 A Calculus of Communicating Systems with Label Passing - Engberg, Nielsen - 1986
44 An Interaction-based Language and its Typing System - Takeuchi, Honda et al. - 1994
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
22 Replication in Concurrent Combinators - Honda, Yoshida - 1994
20 Research topics in Functional Programming (context) - Abramsky, The - 1990
13 Optimal Reduction in Weak -calculus with Shared Environemnts (context) - Yoshida - 1993
9 Set Theoretical Models of Lambda Calculus: Theory (context) - Longo - 1983
4 Annual Symposium on Principles of Programming Languages (context) - Honda, Yoshida - 1994
3 A Study of the -Calculus and its Combinatory Representation (context) - Honda - 1994
1 Fully abstract models of the -calculi (context) - Milner - 1977
1 Annual Symposium on Logic In Computer Science (context) - Howe - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.auc.dk/mobility/bib/honda.html): More
Non-Interleaving Semantics for Mobile Processes - Degano, Priami (1997) (Correct)
Unknown - (Correct)
Combinatory Representation of Mobile Processes - Honda, Yoshida (1994) (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