Testing equivalence as a bisimulation equivalence
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)
Algorithms for checking the various testing preorders and equivalences for finite-state processes are presented. It is shown that (pre)bisimulation-based characterization of these relations relies on the use of appropriate process transformations; the testing relations on the original systems correspond to (pre)bisimulation relations on the altered systems. As a consequence of approach presented, any implementation of a (pre)bisimulation checker can be easily adapted to check for the testing relations. An extended example illustrating these concepts is given.
- A calculus of communicating systems
- A term model for synchronous processes
- Acceptance trees
- Algebraic laws for nondeterminism and concurrency
- Bisimulation and divergence
- Bisimulation can't be traced
- Bisimulation through probabilistic testing
- Calculi for synchrony and asynchrony
- CCS expressions, finite state processes, and three problems of equivalence
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- Testing equivalences for processes
- Three Partition Refinement Algorithms
- (Bi)simulations up-to characterise process semantics
- FDR explorer
- Linda-based applicative and imperative process algebras
- Finite axiom systems for testing preorder and De Simone process languages
- Unifying behavioral equivalences of timed transition systems
- Composition methods for constructing characteristic formulas for dense-time models
- A game for linear-time-branching-time spectroscopy
- Non-bisimulation-based Markovian behavioral equivalences
- Logical characterisations, rule formats and compositionality for input-output conformance simulation
- Processes as formal power series: a coinductive approach to denotational semantics
- Equivalence and preorder checking for finite-state systems
- Simulations up-to and canonical preorders (extended abstract)
- A coalgebraic view on decorated traces
- Process algebra and model checking
- Final semantics for decorated traces
- Towards State Space Reduction Based on T-Lumpability-Consistent Relations
- Modelling Divergence in Relational Concurrent Refinement
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 1538044 (Why is no real title available?)
- Compositionality in state space verification methods
- Model-checking process equivalences
- Model-checking process equivalences
- Deciding all behavioral equivalences at once: a game for linear-time-branching-time spectroscopy
- Consistently-detecting monitors
- Generating diagnostic information for behavioral preorders
- Deriving bisimulation relations from path based equivalence checkers
- Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
- Equations, contractions, and unique solutions
- Tools and Algorithms for the Construction and Analysis of Systems
- Observation equivalence as a testing equivalence
- Equivalence checking 40 years after: a review of bisimulation tools
- A linear-time model-checking algorithm for the alternation-free modal mu-calculus
- An automated proof technique for finite-state machine equivalence
- Coupled Similarity and Contrasimilarity, and How to Compute Them
- Stepwise development of process-algebraic specifications in decorated trace semantics
- Fair testing
- A reduced maximality labeled transition system generation for recursive Petri nets
- 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
- Contract-based discovery of Web services modulo simple orchestrators
This page was built for publication: Testing equivalence as a bisimulation equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366163)
