On reduction-based process semantics

13Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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 stroug and weak settings. The resulting theories in many cases coincide with, and sometimes generallse, observation-based formulation of behavioural equivalence. The basic construction of reduction-based theories is studied, taking a simple name passing calculus called v-calculus as an example. Results on other calculi are also briefly discussed.

Cite

CITATION STYLE

APA

Honda, K., & Yoshida, N. (1993). On reduction-based process semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 761 LNCS, pp. 373–387). Springer Verlag. https://doi.org/10.1007/3-540-57529-4_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free