Abstract
Building on recent work by Rutten on coinduction and formal power series, we define a denotational semantics for the csp calculus and prove it fully abstract for testing equivalence. The proposed methodology allows for abstract definition of operators in terms of behavioural differential equations and for coinductive reasoning on them, additionally dispensing with continuous order-theoretic structures.
Research partially supported by the the EU within the FET – Global Computing Initiative, project mikado, and by the Italian MIUR projects cometa and napoli.
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
Adámek, J.: Final coalgebras are ideal completions of initial algebras. Journal of Logic and Computation 12, 217–242 (2002)
Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5, 1–20 (1993)
De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoret. Comput. Sci. 34, 83–133 (1984)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)
Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)
Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Hofmann, M., Rosolini, G., Pavlovic, D. (eds.) Interval Mathematics. LNCS, vol. 29. Elsevier Science, Amsterdam (1999)
Rutten, J.J.M.M.: Automata, power series, and coinduction: taking input derivatives seriously. Technical Report SEN-R9901, CWI (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boreale, M., Gadducci, F. (2003). Denotational Testing Semantics in Coinductive Form. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive