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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Boreale, M., & Gadducci, F. (2003). Denotational testing semantics in coinductive form. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 279–289. https://doi.org/10.1007/978-3-540-45138-9_22
Mendeley helps you to discover research relevant for your work.