Abstract
Process algebras such as Milner's Calculus of Communicating Systems (CCS) are universalist, i.e., they assume that there is a single universe in which expressions are to be interpreted. We begin an investigation of a model theoretic approach to concurrency in which there are many universes. The classical result reconciling the universalist and model theoretic approaches in equational logic is the theorem of Birkhoff stating that the equations true in a variety are precisely the equations that hold in a free algebra in the variety. We prove a somewhat restricted analogue of Birkhoff's theorem for concurrent algebras, where the main relation is observational equivalence rather than equality.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. C. M. Baeten. Applications of Process Algebra. Cambridge University Press, Cambridge, 1990.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge University Press, Cambridge, 1990.
J. F. A. K. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Napoli, 1983.
A. Blass and Y. Gurevich. Existential fixed-point logic. In E. Börger, editor, Computation Theory and Logic, Volume 270 of Lecture Notes in Computer Science, pages 20–36, Springer-Verlag, New York, 1987.
S. Burris and H. P. Sankappanaver. A Course in Universal Algebra. Springer-Verlag, New York, 1981.
C. C. Chang and H. J. Keisler. Model Theory. North-Holland, Amsterdam, third edition, 1990.
K. J. Compton. A deductive system for existential least fixpoint logic. Logic and Computation 3 (1993), 197–213.
K. J. Compton. Some useful preservation theorems. Journal of Symbolic Logic 48 (1983), 427–440.
P. Glavan and D. Rosenzweig. Communicating evolving algebras. preprint.
K. Gödel. Collected Works, Vol. 1. S. Feferman, et al., eds. Oxford University Press, New York, 1986.
Y. Gurevich. Evolving algebras: a tutorial introduction. Bulletin of the European Association for Theoretical Computer Science 43 (1991), 264–284.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32 (1985), 137–161.
R. Milner. A Calculus of Communicating Systems Volume 92 of Lecture Notes in Computer Science, Springer-Verlag, New York, 1989.
R. Milner. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ, 1980.
R. Milner. A complete axiomatisation for observational congruence of finite state behaviors. Inform. and Comput. 81 (1989), 227–247.
K. Segerberg. Modal logics with linear alternative relations. Theoria 36 (1970), 301–322.
W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science. In Proc. CAAP '93, page, Springer-Verlag, New York, 1993.
R. Uceda-Sosa and K. Compton. A modular approach to observational equivalences. Submitted for publication, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Compton, K.J., Uceda-Sosa, R. (1994). The model theory of concurrency. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049325
Download citation
DOI: https://doi.org/10.1007/BFb0049325
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58277-9
Online ISBN: 978-3-540-48599-5
eBook Packages: Springer Book Archive