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 failure 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 language | English |
|---|---|
| Pages (from-to) | 297-321 |
| Number of pages | 25 |
| Journal | Fundamenta informaticae |
| Volume | 52 |
| Issue number | 4 |
| Publication status | Published - Oct 2002 |
Keywords
- Failure semantics
- Decorated traces
- Bisimulation semantics
- Refinement
- Labelled transition systems