Denotational testing semantics in coinductive form

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 279-289

  Boreale, Michele ^a   Gadducci, Fabio ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Coinduction; Formal power series; Process calculi; Testing equivalence

Indexed keywords

CALCULATIONS; DIFFERENTIAL EQUATIONS;

COINDUCTION; CSP CALCULUS; DENOTATIONAL SEMANTICS; FORMAL POWER SERIES; PROCESS CALCULI; TESTING EQUIVALENCE; TESTING SEMANTICS; THEORETIC STRUCTURES;

SEMANTICS;

EID: 27244435938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_22     Document Type: Article

References (8)

1. J. Adámek. Final coalgebras are ideal completions of initial algebras. Journal of Logic and Computation, 12:217-242, 2002.
2. R. Cleaveland and M. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1-20, 1993.
3. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoret. Comput. Sci., 34:83-133, 1984.
4. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
5. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
6. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
7. J. Power and D. Turi. A coalgebraic foundation for linear time semantics. In M. Hofmann, G. Rosolini, and D. Pavlovic, editors, Category Theory and Computer Science, volume 29 of El. Notes in Theoret. Comput. Sci.. Elsevier Science, 1999.
8. J.J.M.M. Rutten. Automata, power series, and coinduction: taking input derivatives seriously. Technical Report SEN-R9901, CWI, 1999.