Testing equivalence as a bisimulation equivalence

DOI10.1007/BF01211314zbMath0797.68058MaRDI QIDQ2366163

Rance Cleaveland, Matthew C. B. Hennessy

Publication date: 29 June 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

process algebrasautomated verificationfinite-state systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (29)

Non-bisimulation-based Markovian behavioral equivalences ⋮ Process Algebra and Model Checking ⋮ Final Semantics for Decorated Traces ⋮ Fair testing ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Logical characterisations, rule formats and compositionality for input-output conformance simulation ⋮ Composition methods for constructing characteristic formulas for dense-time models ⋮ A reduced maximality labeled transition system generation for recursive Petri nets ⋮ A coalgebraic view on decorated traces ⋮ Generating diagnostic information for behavioral preorders ⋮ Towards State Space Reduction Based on T-Lumpability-Consistent Relations ⋮ Compositionality in state space verification methods ⋮ Comparing disjunctive modal transition systems with an one-selecting variant ⋮ Automatic verification of distributed systems: the process algebra approach. ⋮ CSP is a retract of CCS ⋮ Unifying behavioral equivalences of timed transition systems ⋮ Contract-based discovery of Web services modulo simple orchestrators ⋮ Processes as formal power series: a coinductive approach to denotational semantics ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ Unnamed Item ⋮ A game for linear-time-branching-time spectroscopy ⋮ Equations, Contractions, and Unique Solutions ⋮ (Bi)simulations up-to characterise process semantics ⋮ FDR explorer ⋮ Linda-based applicative and imperative process algebras ⋮ Consistently-detecting monitors ⋮ Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity ⋮ Simulations Up-to and Canonical Preorders ⋮ Stepwise development of process-algebraic specifications in decorated trace semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation and divergence
• CCS expressions, finite state processes, and three problems of equivalence
• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Algebraic laws for nondeterminism and concurrency
• Acceptance trees
• Three Partition Refinement Algorithms
• A term model for synchronous processes
• Bisimulation can't be traced

This page was built for publication: Testing equivalence as a bisimulation equivalence