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.

Denotational Testing Semantics in Coinductive Form / M. BOREALE; F. GADDUCCI. - STAMPA. - (2003), pp. 279-289. [10.1007/978-3-540-45138-9_22]

Denotational Testing Semantics in Coinductive Form

BOREALE, MICHELE;
2003

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.
2003
9783540406716
SFX Get it!(opens in a new window)|View at Publisher| Export | Download | Add to List | More... Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 2747
279
289
M. BOREALE; F. GADDUCCI
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/236450
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
social impact