Comparing Refinements for Failure and Bisimulation Semantics

Authors:
Rik Eshuis;Maarten M. Fokkinga
Affiliations:
Department INF, University of Twente, PO Box 217, 7500 AE Enschede, The Netherlands;Department INF, University of Twente, PO Box 217, 7500 AE Enschede, The Netherlands
Venue:
Fundamenta Informaticae
Year:
2002

Citing 10
Cited 1

Communicating sequential processes

Communicating sequential processes
Bisimulation through probabilistic testing (preliminary report)

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process simulation and refinement

Formal Aspects of Computing
The linear time-branching time spectrum (extended abstract)

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Forward and backward simulations I.: untimed systems

Information and Computation
Using Z: specification, refinement, and proof

Using Z: specification, refinement, and proof
Comparing LOTOS and Z refinement relations

IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Communication and Concurrency

Communication and Concurrency
Protocol Assuring Universal Language

Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science

Required behavior of sequence diagrams: Semantics and conformance

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.00

Visualization

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.