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 v-calculus as an example. Results on other calculi are also briefly discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abramsky, S., The Lazy Lambda Calculus. ed. by D. Turner, Research topics in Functional Programming, Addison Wesley 1990.
Barendregt, H., The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984.
Berry, G. and Boudol, G., The Chemical Abstract Machine. Proc. 17th. Annual Symposium on Principles of Programming Languages, 1990.
Boudol, G., Asynchrony and π-calculus, INRIA Report 1702, INRIA, Sophia Antipolis, 1991.
De Nicola, R. and Hennessy, M. Testing equivalences for processes, Theoretical Computer Science, 34(1), 1984.
Engberg, U. and Nielsen, M., A Calculus of Communicating Systems with Label Passing, Research Report DAIMI PB-208, University of Aarhus, 1986.
Honda, K., Two bisimilarities in v-calculus, submitted. Also as Keio CS report 92-002, 1992.
Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. Proc. ECOOP'91, LNCS 512, Springer-Verlag 1991.
Honda, K. and Yoshida, Y., Reduction-based Process Semantics, to appear as a Keio CS technical report. A preliminary version as Keio CS technical report 92-003, October 1992.
Honda, K. and Yoshida, Y., Combinatory Representation of Mobile Processes, Proc. 21th. Annual Symposium on Principles of Programming Languages, 1994.
Jones, C.B., A pi-calculus Semantics for an Object-Based Design Notation, Proc. CONCUR '93, LNCS 715, Springer Verlag, 1993.
Milner, R., Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.
Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes. Part I/II. ECS-LFCS-89-85/86, Edinburgh University, 1989.
Milner, R., Functions as Processes. Proc. of ICALP'90, LNCS 443, Springer-Verlag, 1990.
Milner, R., Polyadic π-Calculus: a tutorial. Logic and Algebra of Specification, Springer-Verlag, 1992.
Milner, R. and Sangiorgi, D., Barbed Bisimulation. Proc. of ICALP'92, LNCS 623, Springer-Verlag, 1992.
Longo, G., Set Theoretical Models of Lambda Calculus: Theory, Expansions and Isomorphisms, Annals of Pure and Applied Logic, 24:153–188, 1983.
Ong, C-H.L., The Lazy Lambda Calculus: An Investigation into the Foundation of Functional Programming, Phd thesis, Imperial College, 1988.
Park, D., Concurrency and Automata on Infinite Sequences. LNCS 104, Springer-Verlag, 1980.
Thomsen, B., A calculus of higher order communicating systems. Proc. 16th. Annual Symposium on Principles of Programming Languages, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honda, K., Yoshida, N. (1993). On reduction-based process semantics. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_70
Download citation
DOI: https://doi.org/10.1007/3-540-57529-4_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57529-0
Online ISBN: 978-3-540-48211-6
eBook Packages: Springer Book Archive