Failures, Finiteness and Full Abstraction

n/

Failures, Finiteness, and Full Abstraction

ion Franck van Breugel September 09, 1997 ADDR: Corso Italia 40,56125 Pisa,Italy. TEL: +39-50-887111. FAX: +39-50-887226 Failures, Finiteness, and Full Abstraction Franck van Breugel Universit`a di Pisa, Department of Computer Science Corso Italia 40, 56125 Pisa, Italy [email protected] Abstract For a simple CCS-like language a trace semantics and a failure semantics are presented. The failure semantics is shown to be fully abstract with respect to the trace semantics if and only if the set of internal actions is infinite. Introduction In this paper we focus on the full abstraction problem. Already in the early seventies this issue was raised by Milner [Mil73, page 168]. For a discussion of its importance we refer the reader to the introduction of Stoughton's monograph [Sto88]. In the early eighties, Brookes, Hoare, and Roscoe [BHR84] introduced failures to provide a semantics for CSP [Hoa85]. These failures give rise to a fully abstract semantics for CSP as was shown by Bergst..