Abstract
We describe the final universe approach to the characterisation of semantic universes and illustrate it by giving characterisations of the universes of CCS and CSP processes.
This research was partially supported by an SERC Senior Research Fellowship.
Preview
Unable to display preview. Download preview PDF.
References
P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes, No. 14, Stanford University, 1988.
P. Aczel and Nax Mendler, A Final Coalgebra Theorem, in Springer Lecture Notes in Computer Science No. 389, Category Theory and Computer Science, edited by D.H. Pitt et al., pp 357–365.
J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge University Press, 1990.
M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988.
C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985.
Robin Milner, Communication and Concurrency, Prentice Hall, 1989.
Lawrence S. Moss and Satish R. Thatte, Generalisation of Final Algebra Semantics by Relativisation, LNCS 442 (1990), 284–300.
J.J.M.M. Rutten and D. Turi, On the Foundations of Final Semantics: Non-standard sets, Metric Spaces, Partial Orders, Technical Report CS-R9241, CWI (Centre for Mathematics and Computer Science), Amsterdam, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aczel, P. (1994). Final universes of processes. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1993. Lecture Notes in Computer Science, vol 802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58027-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-58027-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58027-0
Online ISBN: 978-3-540-48419-6
eBook Packages: Springer Book Archive