Comparing Refinements for Failure and Bisimulation Semantics

H. Eshuis, M.M. Fokkinga

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on inclusions between decorated traces systems. There exist however pairs of refinements, for bisimulation and failure semantics respectively, that have almost the same properties. Furthermore, each refinement in bisimulation semantics implies its counterpart in failure semantics, and conversely each refinement in failure semantics implies its counterpart in bisimulation semantics defined on the canonical form of the compared processes.
Original languageUndefined
Title of host publicationWorkshop Argentino de Informatica Teorica (WAIT 1999)
Place of PublicationBuenos Aires, Argentina
PublisherSociedad Argentina de Informática e Investigacíon Operativa
Pages65-80
Number of pages16
ISBN (Print)not assigned
Publication statusPublished - Sep 1999
EventWorkshop Argentino de Informatica Teorica (WAIT 1999) - Buenos Aires, Argentina
Duration: 6 Sep 199910 Sep 1999

Publication series

Name
PublisherSociedad Argentina de Informática e Investigacíon Operativa

Workshop

WorkshopWorkshop Argentino de Informatica Teorica (WAIT 1999)
Period6/09/9910/09/99
Other6-10 Sep 1999

Keywords

  • EWI-7210
  • METIS-119622
  • IR-63500

Cite this