Denotational Testing Semantics in Coinductive Form
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.
Keywordsprocess calculi coinduction formal power series testing equivalence
Unable to display preview. Download preview PDF.
- 7.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)Google Scholar
- 8.Rutten, J.J.M.M.: Automata, power series, and coinduction: taking input derivatives seriously. Technical Report SEN-R9901, CWI (1999)Google Scholar