Fundamenta Informaticae · 2002 · 18 citations · 8 references
ComputingComputer ScienceComputer ArchitectureFormal MethodsSemanticsConcurrency VerificationEquivalence CheckingModel CheckingBisimulationBisimulation AnalysisCanonical Form ComputationEquivalence Of Transition SystemsTransition Systems
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.
8
Testing equivalences for processes
Rocco De Nicola, Matthew Hennessy · Theoretical Computer Science · 1984 · 1.2K citations
Calculi for synchrony and asynchrony
Robin Milner · Theoretical Computer Science · 1983 · 898 citations · Full text
Forward and Backward Simulations
Nancy Lynch, Frits Vaandrager · Information and Computation · 1995 · 402 citations · Full text
Bisimulation through probabilistic testing (preliminary report)
Kim G. Larsen, Arne Skou · 1989 · 152 citations · Full text