Failures, Finiteness, and Full Abstraction

  • Authors:
  • Franck van Breugel

  • Affiliations:
  • -

  • Venue:
  • Failures, Finiteness, and Full Abstraction
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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.