Arrow Research search
Back to MFCS

MFCS 2003

Denotational Testing Semantics in Coinductive Form

Conference Paper Contributed Papers Algorithms and Complexity ยท Theoretical Computer Science

Abstract

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.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
1019332619257365960
v2026.09.13