#### DMCA

## On reduction-based process semantics (1995)

### Cached

### Download Links

- [repository.kulib.kyoto-u.ac.jp]
- [ftp.cs.keio.ac.jp]
- [www.mcs.le.ac.uk]
- [www.doc.ic.ac.uk]
- [ftp.dcs.qmw.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proceedings of FSTTCS ’93, LNCS 761 |

Citations: | 160 - 27 self |

### Citations

3948 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ... obtain, by Theorem 3.19: a:(b:c 1 \Phi b:c 2 ) == = a:b:c 1 \Phi a:b:c 2 with a; b; c distinct, showing how close sound theories are to the typical (weak) bisimulation (cf. Section 4 of Chapter 9 in =-=[17]-=-). So a natural question is whether there are any pairs of terms not equated by =a but equated by =s. Actually such pairs exist, and, interestingly, the additional equations capture one of the essenti... |

1613 |
A Calculus of Communicating Systems,
- Milner
- 1980
(Show Context)
Citation Context ...er we can have a general framework to derive meaningful process equivalences from the new construction, which are as significant as well-known behavioural equivalences over agents e.g. bisimilarities =-=[19, 12]-=-. What we are going to show in the subsequent sections, is that a general framework to derive significant congruences over processes from the new construction in a mathematically elegant way, does exi... |

1275 |
The Lambda Calculus: Its Syntax and Semantics.
- Barendregt
- 1981
(Show Context)
Citation Context ...or not. More study is needed regarding the issue. One remarkable point is the similarity in a way of deriving canonical congruences over processes between our construction and those found in -calculi =-=[2, 1, 18], as was a-=-lready noted. What is common in these constructions is that the canonical equality is obtained as the maximum element of a sizable family of "meaningful" equalities. The method is not only m... |

1184 | A calculus of mobile processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...algebra for processes (cf. ff-equality), we can view reduction relation as representing the basic mechanism of computation in a given formalism. Especially in the area of higher-order process calculi =-=[13, 14, 15, 8]-=-, it was found that the reduction-based formulation enjoys much more simplicity than the transition-based one. It remains open, however, whether we can have a general framework to derive meaningful pr... |

778 | Concurrency and automata on infinite sequences, in: - Park - 1981 |

543 | The chemical abstract machine,
- Berry, Boudol
- 1992
(Show Context)
Citation Context ...uction relation and equational reasoning. Our starting point is the formulation of operational semantics for processes based on reduction relation and structural rules, introduced by Berry and Boudol =-=[3]-=- and Milner [14]. By regarding structural rules as the embedded algebra for processes (cf. ff-equality), we can view reduction relation as representing the basic mechanism of computation in a given fo... |

526 | Testing equivalences for processes.
- Nicola, Hennessy
- 1984
(Show Context)
Citation Context ...ting are still missing. Finally, noting that reduction-closed equalities roughly correspond to bisimilarities, it is natural to ask what formulation would correspond to e.g. may and must equivalences =-=[5]. We can u-=-se "saturated" insensitive terms i.e. the set fP j = 3s` P = 3g, possibly combined with divergence notion. To find more direct ways of deriving such theories (i.e. without deriving = 3sfirst... |

392 | An object calculus for asynchronous communication.
- Honda, Tokoro
- 1991
(Show Context)
Citation Context ...algebra for processes (cf. ff-equality), we can view reduction relation as representing the basic mechanism of computation in a given formalism. Especially in the area of higher-order process calculi =-=[13, 14, 15, 8]-=-, it was found that the reduction-based formulation enjoys much more simplicity than the transition-based one. It remains open, however, whether we can have a general framework to derive meaningful pr... |

370 | Functions as Processes. - Milner - 1992 |

285 |
The Polyadic -calculus. a tutorial,
- Milner
- 1991
(Show Context)
Citation Context ...bedded algebra for processes (cf. ff-equality), we can view the reduction relation as representing the basic mechanism of computation in a given formalism. In the area of higher-order process calculi =-=[20, 18, 19, 7]-=-, it was found that the reduction-based formulation enjoys much more simplicity than the transition-based one. It remains an open question, however, as to whether we can have a general framework for d... |

255 | Barbed bisimulation.
- Milner, Sangiorgi
- 1992
(Show Context)
Citation Context ...t a general framework to derive significant congruences over processes from the new construction in a mathematically elegant way, does exist. While works with the aim similar to ours appeared already =-=[16, 4]-=-, our construction has several significant aspects not found in those precursors. Firstly, the basic formal apparatus is an extension of the well-studied method in both strict and lazy -theories [2, 1... |

253 | The lazy lambda-calculus.
- Abramsky
- 1990
(Show Context)
Citation Context ...6, 4], our construction has several significant aspects not found in those precursors. Firstly, the basic formal apparatus is an extension of the well-studied method in both strict and lazy -theories =-=[2, 1, 18]-=-, using the maximality condition among a certain family of congruences to derive canonical equality over agents. Specifically a fundamental element of the construction is reduction-closure for equalit... |

152 | An Interaction-based Language and its Typing System. In
- Takeuchi, Honda, et al.
- 1994
(Show Context)
Citation Context ...ge where a definite notion of observation is not easily formulated, while a reduction relation can be naturally given, e.g. parallel languages with shared store or with complex interaction primitives =-=[12, 24, 26]-=-. We hope that the presented construction is helpful in such situations. The present exposition develops the reduction-based semantic framework taking a small process calculus called -calculus [7, 4, ... |

126 | A Theory of Higher Order Communicating Systems”,
- Thomsen
- 1995
(Show Context)
Citation Context ...dered to be the "minimised observability" in [16]. Such development is important when it is difficult to identify a canonical notion of observation in given formalisms and programming langua=-=ges (e.g. [11, 20, 13, 8]). A signi-=-ficant example is -calculus [8, 7, 10], an offspring from -calculus [13], where we have two "natural" notions of observation which induce quite different transition relations and bisimilarit... |

109 | Equality in Lazy Computation Systems”.
- Howe
- 1989
(Show Context)
Citation Context ...t lemma" [15] in the setting of functional theories. The same is true in the subsequent development. To clarify a general condition under which such a property holds is an interesting open issue,=-= cf. [11]-=-. 4. Operators and Observability =sand Equators 4.1. In the following we try to explicate the equations by =sby showing its difference from =a , a theory based on the asynchronous weak bisimilarity. A... |

91 | A $\mathrm{p}\mathrm{i}$-calculus Semantics for an Object-Based Design Notation
- Jones
- 1993
(Show Context)
Citation Context ...dered to be the "minimised observability" in [16]. Such development is important when it is difficult to identify a canonical notion of observation in given formalisms and programming langua=-=ges (e.g. [11, 20, 13, 8]). A signi-=-ficant example is -calculus [8, 7, 10], an offspring from -calculus [13], where we have two "natural" notions of observation which induce quite different transition relations and bisimilarit... |

91 |
Optimal Reductions in the Lambda-Calculus.
- Levy
- 1980
(Show Context)
Citation Context ...-terms in addition, is left to our future report. 6.18. Question. What may be the result of applying the "strong" construction of Section 5 to (sound) theories in this setting, specifically =-=to K (cf. [13]-=-)? 7. Concluding Remarks 7.1. Comparison with convergence-based semantics for processes. There are two important predecessors to our work. Boudol [4] studied (in)equation over essentially the same sys... |

65 | A calculus of communicating systems with label passing
- Engberg, Nielsen
- 1986
(Show Context)
Citation Context ...on with related work, and points out further issues. Most of proofs are omitted, for which the reader would refer to [9]. 2 -calculus 2. 1. Terms and reduction. -calculus, an offspring from -calculus =-=[6, 13, 14]-=-, is a small formalism of concurrency with the notion of asynchronous name passing as the interaction primitive [8, 7, 10] (cf. [4]). The simple primitive, coupled with capability to generate new name... |

48 |
Asynchrony and the ��-calculus
- Boudol
- 1992
(Show Context)
Citation Context ...t a general framework to derive significant congruences over processes from the new construction in a mathematically elegant way, does exist. While works with the aim similar to ours appeared already =-=[16, 4]-=-, our construction has several significant aspects not found in those precursors. Firstly, the basic formal apparatus is an extension of the well-studied method in both strict and lazy -theories [2, 1... |

45 |
Set-theoretical models of lambda-calculus: Theories, expansions, isomorphisms.
- Longo
- 1983
(Show Context)
Citation Context ... is: can we get any (interesting) observables following our framework based on reduction-closure? It seems that soundness does not directly leads to observability, regardingsstrongly unsolvable terms =-=[17, 1]-=- as the insensitive terms. However if we also add identification of PO1 terms [17, 18], then we obtain the canonical theory after picking up head normal forms as generic observables, which coincides w... |

43 |
The Lazy Lambda Calculus: A n Investigation into the Foundations of Functional Programming
- Ong
- 1988
(Show Context)
Citation Context ...6, 4], our construction has several significant aspects not found in those precursors. Firstly, the basic formal apparatus is an extension of the well-studied method in both strict and lazy -theories =-=[2, 1, 18]-=-, using the maximality condition among a certain family of congruences to derive canonical equality over agents. Specifically a fundamental element of the construction is reduction-closure for equalit... |

43 | Asynchrony and the pi-calculus
- Boudol
- 1992
(Show Context)
Citation Context ... a general framework to derive significant congruences over processes from the new construction in a mathematically elegant way, does exist. While works with the aim similar to ours appeared already $=-=[16, 4]-=-$ , our construction has several significant aspects not found in those precursors. Firstly, the $\mathrm{b}\mathrm{a}s$ ic formal apparatus is an extension of the well-studied method in both strict a... |

20 |
The polyadic -calculus: A tutorial. Logic and Algebra of Specification
- Milner
- 1993
(Show Context)
Citation Context ...algebra for processes (cf. ff-equality), we can view reduction relation as representing the basic mechanism of computation in a given formalism. Especially in the area of higher-order process calculi =-=[13, 14, 15, 8]-=-, it was found that the reduction-based formulation enjoys much more simplicity than the transition-based one. It remains open, however, whether we can have a general framework to derive meaningful pr... |

19 | Combinatory representation of mobile processes
- Honda, Yoshida
- 1994
(Show Context)
Citation Context ...24, 26]. We hope that the presented construction is helpful in such situations. The present exposition develops the reduction-based semantic framework taking a small process calculus called -calculus =-=[7, 4, 8, 10]-=-, an offspring of -calculus [20, 18], together with its extensions, as the main object of the study. Simple as it is, this calculus enjoys a striking expressive power [4, 7, 10], and relates to certai... |

19 |
The polyadic pi-calculus: a tutorial, in Logic and Algebra of Specification
- Milner
- 1993
(Show Context)
Citation Context ... algebra for processes (cf. a-equality), we can view reduction relation as representing the basic mechanism of computation in a given formalism. Especially in the area of higher-order process calculi =-=[13, 14, 15, 8]-=-, it was found that the reduction-based formulation enjoys much more simplicity than the transition-based one. It remains open, however, whether we can have a general framework to derive meaningful pr... |

10 |
Optimal reduction in weak -calculus with shared environments
- Yoshida
- 1993
(Show Context)
Citation Context ...ge where a definite notion of observation is not easily formulated, while a reduction relation can be naturally given, e.g. parallel languages with shared store or with complex interaction primitives =-=[12, 24, 26]-=-. We hope that the presented construction is helpful in such situations. The present exposition develops the reduction-based semantic framework taking a small process calculus called -calculus [7, 4, ... |

4 |
Combinatory Representation of Mobile
- Honda, Yoshida
- 1994
(Show Context)
Citation Context ...ch development is important when it is difficult to identify a canonical notion of observation in given formalisms and programming languages (e.g. [11, 20, 13, 8]). A significant example is -calculus =-=[8, 7, 10], an offsp-=-ring from -calculus [13], where we have two "natural" notions of observation which induce quite different transition relations and bisimilarities, as detailed in Section 2. Semantics for thi... |

3 |
A Study of -calculus and its Combinatory Representation
- Honda
- 1994
(Show Context)
Citation Context ...24, 26]. We hope that the presented construction is helpful in such situations. The present exposition develops the reduction-based semantic framework taking a small process calculus called -calculus =-=[7, 4, 8, 10]-=-, an offspring of -calculus [20, 18], together with its extensions, as the main object of the study. Simple as it is, this calculus enjoys a striking expressive power [4, 7, 10], and relates to certai... |

2 |
Reduction-based Process Semantics, The full version as Keio CS technical report 94-002
- Honda, Yoshida
- 1994
(Show Context)
Citation Context ...uction-based framework. Section 5 mentions results on other calculi, gives comparison with related work, and points out further issues. Most of proofs are omitted, for which the reader would refer to =-=[9]-=-. 2 -calculus 2. 1. Terms and reduction. $\nu$-calculus, an offspring from $\pi$-calculus [6, 13, 14], is a small formalism of concurrency with the notion of asynchronous name passing as the interacti... |

1 |
Two bisimilarities in -calculus, submitted
- Honda
(Show Context)
Citation Context ...ch development is important when it is difficult to identify a canonical notion of observation in given formalisms and programming languages (e.g. [11, 20, 13, 8]). A significant example is -calculus =-=[8, 7, 10], an offsp-=-ring from -calculus [13], where we have two "natural" notions of observation which induce quite different transition relations and bisimilarities, as detailed in Section 2. Semantics for thi... |

1 |
Reduction-based Process Semantics, to appear as a Keio CS technical report. A preliminary version as Keio CS technical report 92-003
- Honda, Yoshida
- 1992
(Show Context)
Citation Context ...uction-based framework. Section 5 mentions results on other calculi, gives comparison with related work, and points out further issues. Most of proofs are omitted, for which the reader would refer to =-=[9]-=-. 2 -calculus 2. 1. Terms and reduction. -calculus, an offspring from -calculus [6, 13, 14], is a small formalism of concurrency with the notion of asynchronous name passing as the interaction primiti... |

1 |
Two bisimilarities in -calculus, submitted. Also as Keio CS report
- Honda
- 1992
(Show Context)
Citation Context ...ch development is important when it is difficult to identify a canonical notion of observation in given formalisms and programming languages (e.g. [11, 20, 13, 8]). A significant example is -calculus =-=[8, 7, 10], an offsp-=-ring from -calculus [13], where we have two "natural" notions of observation which induce quite different transition relations and bisimilarities, as detailed in Section 2. Semantics for thi... |

1 |
Fully abstract models of the -calculi
- Milner
(Show Context)
Citation Context ...y, if we construct the maximum theory in the setting of reduction-contexts, its equations coincide with those from =s. The situation is somewhat analogous to what has been stated as a "context le=-=mma" [15]-=- in the setting of functional theories. The same is true in the subsequent development. To clarify a general condition under which such a property holds is an interesting open issue, cf. [11]. 4. Oper... |

1 |
Two bisimilarities in $\nu$-calculus, submitted
- Honda
(Show Context)
Citation Context ...ent is important when it is difficult to identify a canonical notion of observation in given formalisms and programming languages (e.g. [11, 20, 13, 8]). A significant example is $l\text{ }$-calculus =-=[8, 7, 10]-=-, an offspring from $\pi$-calculus [13], where we have two $‘\zeta \mathrm{n}\mathrm{a}\mathrm{t}\mathrm{u}\mathrm{r}\mathrm{a}\mathrm{l}$” notions of observation which induce quite different transiti... |

1 |
The Lazy Lambda Calcu,lus: An Investigation into the Foundation
- Ohg
- 1988
(Show Context)
Citation Context ...n has several significant aspects not found in those precursors. Firstly, the $\mathrm{b}\mathrm{a}s$ ic formal apparatus is an extension of the well-studied method in both strict and lazy A-theories =-=[2, 1, 18]-=-, using the maximality condition among a certain family of congruences to derive canonical equality over agents. Specifically a fundamental element of the construction is reduction-closure for equalit... |