Abstract
We present a model theoretic analysis of synchronization of deterministic CSP processes. We show that there is co-amalgamation within the indexed coalgebraic reconstruction of CSP developed in [14]. Synchronization, however, can not be characterized in terms of co-amalgamation. We show that synchronization can be described, nevertheless, as a pullback construction within the corresponding fibred algebraic setting. Analyzing and generalizing the transition between the indexed and the fibred setting we show that for a wide range of signature embeddings ϕ:Σ 1→Σ 2 the Σ 1-algebras, traditionally considered as parameter algebras, can be considered also as signatures, instead.
Research partially supported by the Norwegian NFR project MoSIS/IKT.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barr, M., Wells, C.: Category Theory for Computing Science. Series in Computer Science. Prentice Hall International, London (1990)
Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras. Mathematical Research — Mathematische Forschung, vol. 32. Akademie-Verlag, Berlin (1986)
Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Berlin (1985)
Fiadeiro, J.L.: Categories for Software Engineering. Springer, Berlin (2005)
Goguen, J.A., Burstall, R.M.: Institutions: Abstract Model Theory for Specification and Programming. Journals of the ACM 39(1), 95–146 (1992)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Jacobs, B., Rutten, J.: A Tutorial on (Co)Algebras and (Co)Induction. Bulletin of EATCS 62, 222–259 (1997)
Pattinson, D.: Translating Logics for Coalgebras. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) Recent Trends in Algebraic Development Techniques. LNCS, vol. 2755, Springer, Heidelberg (2003)
Reichel, H.: Initial Computability, Algebraic Specifications, and Partial Algebras. Oxford University Press, Oxford (1987)
Rutten, J.J.M.M.: Automata and coinduction (an exersice in coalgebra). Technical Report SEN-R9803, CWI (1998)
Rutten, J.J.M.M.: Universal coalgebra: A theory of systems. TCS 249, 3–80 (2000)
Wolter, U.: An Algebraic Approach to Deduction in Equational Partial Horn Theories. J. Inf. Process. Cybern. EIK 27(2), 85–128 (1990)
Wolter, U.: On Corelations, Cokernels, and Coequations. In: Reichel, H. (ed.) Proceedings of Third Workshop on Coalgebraic Methods in Computer Science (CMCS’2000), Berlin, Germany. ENTCS, vol. 33, pp. 347–366. Elsevier, Amsterdam (2000)
Wolter, U.: CSP, Partial Automata, and Coalgebras. TCS 280, 3–34 (2002)
Wolter, U.: Cofree Coalgebras for Signature Morphisms. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 275–290. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wolter, U. (2007). A (Co)Algebraic Analysis of Synchronization in CSP. In: Fiadeiro, J.L., Schobbens, PY. (eds) Recent Trends in Algebraic Development Techniques. WADT 2006. Lecture Notes in Computer Science, vol 4409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71998-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-71998-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71997-7
Online ISBN: 978-3-540-71998-4
eBook Packages: Computer ScienceComputer Science (R0)