Abstract
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We illustrate the usefulness of our approach by providing a fully-abstract denotational semantics for CCS under weak bisimilarity.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Abramsky, S.: A domain equation for bisimulation. Inf. Comput. 92(2), 161–218 (1991)
Aczel, P.: Final universes of processes. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 1–28. Springer, Heidelberg (1994)
Baldamus, M., Parrow, J., Victor, B.: A fully abstract encoding of the pi-calculus with data terms. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1202–1213. Springer, Heidelberg (2005)
Baldamus, M., Stauner, T.: Modifying Esterel concepts to model hybrid systems. Electr. Notes Theor. Comput. Sci. 65(5) (2002)
Bloom, B.: Structural operational semantics for weak bisimulations. Theor. Comput. Sci., 146(1&2), 25–68 (1995)
Boreale, M., Gadducci, F.: Denotational testing semantics in coinductive form. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 279–289. Springer, Heidelberg (2003)
Buscemi, M.G., Montanari, U.: A first order coalgebraic model of π-calculus early observational equivalence. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 449–465. Springer, Heidelberg (2002)
Cattani, G.L., Sewell, P.: Models for name-passing processes: interleaving and causal. In: LICS 2000, pp. 322–333 (2000)
Fiore, M., Cattani, G.L., Winskel, G.: Weak bisimulation and open maps. In: LICS 1999, pp. 67–76 (1999)
Fiore, M.P., Moggi, E., Sangiorgi, D.: A fully-abstract model for the π-calculus. In: LICS 1996, pp. 43–54 (1996)
Hennessy, M.: A fully abstract denotational semantics for the π-calculus. Theor. Comput. Sci. 278(1-2), 53–89 (2002)
Honsell, F., Lenisa, M., Montanari, U., Pistore, M.: Final semantics for the pi-calculus. In: PROCOMET 1998, pp. 225–243 (1998)
Lenisa, M.: Themes in Final Semantics. Dipartimento di Informatica, Universita‘ di Pisa, TD 6 (1998)
Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts i and ii. Inf. Comput. 100(1), 1–77 (1992)
Nielsen, M., Chang, A.: Observe behaviour categorically. In: FST&TCS 1995, pp. 263–278 (1995)
Popescu, A.: A fully abstract coalgebraic semantics for the pi-calculus under weak bisimilarity. Tech. Report UIUCDCS-R-2009-3045. University of Illinois (2009)
Rutten, J.J.M.M.: Processes as terms: Non-well-founded models for bisimulation. Math. Struct. Comp. Sci. 2(3), 257–275 (1992)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3–80 (2000)
Sangiorgi, D., Walker, D.: The π-calculus. A theory of mobile processes. Cambridge (2001)
Sokolova, A., de Vink, E.P., Woracek, H.: Weak bisimulation for action-type coalgebras. Electr. Notes Theor. Comput. Sci. 122, 211–228 (2005)
Stark, I.: A fully-abstract domain model for the π-calculus. In: LICS 1996, pp. 36–42 (1996)
Staton, S.: Name-passing process calculi: operational models and structural operational semantics. PhD thesis, University of Cambridge (2007)
Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: LICS 1997, pp. 280–291 (1997)
van Glabbeek, R.J.: On cool congruence formats for weak bisimulations. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 318–333. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Popescu, A. (2009). Weak Bisimilarity Coalgebraically. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)