References

1. Roberto M. Amadio, Ilaria Castellani & Davide Sangiorgi (1998): On bisimulations for the asynchronous pi-calculus. Theoretical Computer Science 195(2), pp. 291 – 324, doi:10.1007/3-540-61604-7_53.
2. Steve Awodey (2010): Category Theory (Oxford Logic Guides), 2 edition. Oxford University Press, USA, doi:10.1093/acprof:oso/9780198568612.001.0001.
3. Marcelo P. Fiore & Daniele Turi (2001): Semantics of Name and Value Passing. In: 16th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, pp. 93–104, doi:10.1109/LICS.2001.932486.
4. Tatsuya Hagino (1987): A Categorical Programming Language. University of Edinburgh.
5. G.H. Mealy (1955): A Method to Synthesizing Sequential Circuits. Bell System Technical Journal, pp. 1045–1079.
6. R. Milner (1982): A Calculus of Communicating Systems. Springer-Verlag New York, Inc..
7. Rocco De Nicola & Matthew Hennessy (1984): Testing Equivalences for Processes. Theoretical Computer Science 34, pp. 83–133, doi:10.1016/0304-3975(84)90113-0.
8. Alessandra Palmigiano (2002): Abstract Logics as Dialgebras. Electronic Notes in Theoretical Computer Science 65(1), pp. 254–269. CMCS'2002, Coalgebraic Methods in Computer Science., doi:10.1016/S1571-0661(04)80367-0.
9. Erik Poll & Jan Zwanenburg (2001): From Algebras and Coalgebras to Dialgebras. Electronic Notes in Theoretical Computer Science 44(1), pp. 289 – 307. CMCS'2001, Coalgebraic Methods in Computer Science., doi:10.1016/S1571-0661(04)80915-0.
10. J. J. M. M. Rutten (2000): Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), pp. 3 – 80, doi:10.1016/S0304-3975(00)00056-6.
11. A. Sokolova (2005): Coalgebraic Analysis of Probabilistic Systems. TU Eindhoven.
12. Daniele Turi & Gordon Plotkin (1997): Towards a Mathematical Operational Semantics. In: 12th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, pp. 280–291, doi:10.1109/LICS.1997.614955.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org