Processes as formal power series: A coinductive approach to denotational semantics

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 440-458

  Boreale, Michele ^a   Gadducci, Fabio ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Bisimulation; Coinduction; Formal power series; Process calculi; Testing equivalence

Indexed keywords

ALGEBRA; AUTOMATION; COMPUTER SIMULATION; DIFFERENTIAL EQUATIONS; MATHEMATICAL MODELS;

BISIMULATION; COINDUCTION; FORMAL POWER SERIES; PROCESS CALCULI; TESTING EQUIVALENCE;

SEMANTICS;

EID: 33746651553     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.030     Document Type: Article

References (26)

1. P. Aczel, Non-well-founded sets, Center for the Study of Language and Information, Stanford University. CSLI Lecture Notes, Vol. 14, 1988.
2. Adámek J. Final coalgebras are ideal completions of initial algebras. J. Logic Comput. 12 (2002) 217-242
3. Barr M. Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 114 (1993) 299-315
4. M. Boreale, F. Gadducci, Denotational testing semantics in coinductive form, in: B. Rovan, P. Vojtás (Eds.), Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003, pp. 279-289.
5. Cleaveland R., and Hennessy M. Testing equivalence as a bisimulation equivalence. Formal Aspects Comput. 5 (1993) 1-20
6. Corradini A., Heckel R., and Montanari U. Compositional SOS and beyond: a coalgebraic view of open systems. Theoret. Comput. Sci. 280 (2002) 163-192
7. D. de Frutos Escrig, C.G. Rodriguez, Bisimulation up-to for the linear time branching time spectrum, in: M. Abadi, L. de Alfaro (Eds.), Concurrency Theory, Lecture Notes in Computer Science, Vol. 3653, Springer, Berlin, 2005, pp. 278-292.
8. De Nicola R. Extensional equivalences for transition systems. Acta Inform. 24 (1987) 211-237
9. De Nicola R., and Hennessy M. Testing equivalences for processes. Theoret. Comput. Sci. 34 (1984) 83-133
10. Hennessy M. Algebraic Theory of Processes (1988), MIT Press, Cambridge, MA
11. Hoare C.A.R. Communicating Sequential Processes (1985), Prentice-Hall, Englewood Cliffs, NJ
12. Hughes J., and Jacobs B. Simulations in coalgebra. Theoret. Comput. Sci. 327 (2004) 71-108
13. B. Jacobs, Trace semantics for coalgebras, in: J. Adámek, S. Milius (Eds.), Coalgebraic Methods in Computer Science, Electrical Notes in Theoretical Computer Science, Vol. 106, Elsevier, Amsterdam, 2004, pp. 167-184.
14. B. Jacobs, A bialgebraic review of regular expressions, deterministic automata and languages, in: K. Futatsugi, J.-P. Jouannaud, J. Meseguer (Eds.), Algebra, Meaning, and Computation (Goguen Festschrift), Lecture Notes in Computer Science, Vol. 4060, Springer, Berlin, 2006, pp. 375-404.
15. B. Jacobs, Introduction to coalgebra, Towards Mathematics of States and Observations. Available from 〈www.cs.ru.nl/B.Jacobs/CLG/JacobsCoalgebraIntro.pdf〉, in preparation.
16. B. Klin, A coalgebraic approach to process equivalence and a coinduction principle for traces, in: J. Adámek, S. Milius (Eds.), Coalgebraic Methods in Computer Science, Electrical Notes in Theoretical Computer Science, Vol. 106, Elsevier, Amsterdam, 2004, pp. 201-218.
17. Milner R. Communication and Concurrency (1989), Prentice-Hall, Englewood Cliffs, NJ
18. Milner R., Parrow J., and Walker D. A calculus of mobile processes. Part I and II. Inform. Comput. 100 (1992) 1-77
19. Pin J.-E. Tropical semirings. In: Gunawardena J. (Ed). Idempotency (1998), Cambridge University Press, Cambridge 50-69
20. J. Power, D. Turi, A coalgebraic foundation for linear time semantics, in: M. Hofmann, G. Rosolini, D. Pavlovic (Eds.), Category Theory and Computer Science, Electrical Notes in Theoretical Computer Science, Vol. 29, Elsevier Science, Amsterdam, 1999.
21. J.J.M.M. Rutten, Automata, power series and coinduction: taking input derivatives seriously (extended abstract), in: J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 645-654.
22. Rutten J.J.M.M. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoret. Comput. Sci. 308 (2003) 1-53
23. Sangiorgi D. On the bisimulation proof method. Math. Structures Comput. Sci. 8 (1998) 447-480
24. Turi D., and Plotkin G. Towards a mathematical operational semantics. Logic in Computer Science (1997), IEEE Computer Society Press, Silver Spring, MD 280-291
25. Wolter U. CSP, partial automata and coalgebras. Theoret. Comput. Sci. 280 (2002) 3-34
26. Hasuo I., and Jacobs B. Context-free languages via coalgebraic trace semantics. In: Fiadeiro J.L., Harman N., Roggenbach M., and Rutten J. (Eds). Algebra and Coalgebra in Computer Science (2005), Lecture Notes in Computer Science, Vol. 3629, Springer, Berlin 213-231