Abstract
We use dialgebras, generalising both algebras and coalgebras, as a complement of the standard coalgebraic framework, aimed at describing the semantics of an interactive system by the means of reaction rules. In this model, interaction is built-in, and semantic equivalence arises from it, instead of being determined by a (possibly difficult) understanding of the side effects of a component in isolation. Behavioural equivalence in dialgebras is determined by how a given process interacts with the others, and the obtained observations. We develop a technique to inter-define categories of dialgebras of different functors, that in particular permits us to compare a standard coalgebraic semantics and its dialgebraic counterpart. We exemplify the framework using the CCS and the π-calculus. Remarkably, the dialgebra giving semantics to the π-calculus does not require the use of presheaf categories.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fiore, M.P., Turi, D.: Semantics of name and value passing. In: 12th Annual Symposium on Logic in Computer Science (LICS), pp. 93–104. IEEE (2001)
Trnková, V., Goralcík, P.: On products in generalized algebraic categories. Commentationes Mathematicae Universitatis Carolinae 10(1), 49–89 (1969)
Adámek, J.: Limits and colimits in generalized algebraic categories. Czechoslovak Mathematical Journal 26(1), 55–64 (1976)
Hagino, T.: A Categorical Programming Language. PhD thesis, University of Edinburgh (1987)
Poll, E., Zwanenburg, J.: From algebras and coalgebras to dialgebras. Electronic Notes in Theoretical Computer Science 44(1), 289–307 (2001)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)
Voutsadakis, G.: Universal dialgebra: unifying algebra and coalgebra. Far East Journal of Mathematical Sciences 44(1), 1–53 (2010)
Madeira, A., Martins, M.A., Barbosa, L.: Models as arrows: the role of dialgebras. In: 7th Conference on Computability in Europe, Sofia, Bulgaria, pp. 144–153 (2011)
Ciancia, V.: Interaction and observation, categorically. In: 4th Interaction and Concurrency Experience. EPTCS, vol. 59, pp. 25–36 (2011)
Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)
Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science 274, 183–230 (2002)
Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing 10(2), 163–186 (2003)
Milner, R. (ed.): A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Staton, S.: Relating coalgebraic notions of bisimulation. Logical Methods in Computer Science 7(1) (2011)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I. Information and Computation 100(1), 1–40 (1992)
Sangiorgi, D., Walker, D.: The π-Calculus: A Theory of Mobile Processes. Cambridge University Press, New York (2001)
Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: 12th Annual Symposium on Logic in Computer Science (LICS), pp. 280–291. IEEE (1997)
Blok, A.: Interaction, observation and denotation: A study of dialgebras for program semantics. Master’s thesis, University of Amsterdam (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciancia, V. (2013). Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras. In: Heckel, R., Milius, S. (eds) Algebra and Coalgebra in Computer Science. CALCO 2013. Lecture Notes in Computer Science, vol 8089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40206-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-40206-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40205-0
Online ISBN: 978-3-642-40206-7
eBook Packages: Computer ScienceComputer Science (R0)