Observation equivalence as a testing equivalence
From MaRDI portal
Publication:580965
Recommendations
Cites work
- scientific article; zbMATH DE number 3885853 (Why is no real title available?)
- scientific article; zbMATH DE number 3843129 (Why is no real title available?)
- scientific article; zbMATH DE number 3852428 (Why is no real title available?)
- scientific article; zbMATH DE number 3814961 (Why is no real title available?)
- scientific article; zbMATH DE number 3940707 (Why is no real title available?)
- scientific article; zbMATH DE number 3956420 (Why is no real title available?)
- scientific article; zbMATH DE number 3688686 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- A Powerdomain Construction
- A calculus of communicating systems
- Bisimulation can't be traced
Cited in
(52)- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- The mays and musts of concurrent strategies
- Processes against tests: on defining contextual equivalences
- Goodbye ioco
- Limited approximate bisimulations and the corresponding rough approximations
- Experimenting with process equivalence
- On relating concurrency and nondeterminism
- Refusal testing
- Testing divergent transition systems
- A hierarchy of reverse bisimulations on stable configuration structures
- Specification styles in distributed systems design and verification
- A fully abstract denotational semantics for the calculus of higher-order communicating systems
- Termination, deadlock and divergence
- Transition system specifications with negative premises
- Reverse bisimilarity vs. forward bisimilarity
- A characterization of finitary bisimulation
- Structured operational semantics and bisimulation as a congruence
- Bisimulation through probabilistic testing
- Trace, failure and testing equivalences for communicating processes
- Modelling Divergence in Relational Concurrent Refinement
- Testability of a communicating system through an environment
- Testing preorders for probabilistic processes can be characterized by simulations
- Bisimulation on speed: a unified approach
- Generating diagnostic information for behavioral preorders
- Corrigendum: ``A domain equation for bisimulation by S. Abramsky
- Testing probabilistic equivalence through reinforcement learning
- A general conservative extension theorem in process algebras with inequalities
- Bisimulation and divergence
- Connection between logical and algebraic approaches to concurrent systems
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Testing for a conformance relation based on acceptance
- Quantales, observational logic and process semantics
- On implementations and semantics of a concurrent programming language
- Ordered SOS process languages for branching and eager bisimulations
- Branching vs. Linear Time: Semantical Perspective
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Finite axiom systems for testing preorder and De Simone process languages
- On the operational semantics of nondeterminism and divergence
- A domain equation for bisimulation
- CSP is a retract of CCS
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- Domain theory, testing and simulation for labelled Markov processes
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Observational structures and their logic
- TIC: a tImed calculus
- Labelled Markov processes as generalised stochastic relations
- Quantales, finite observations and strong bisimulation
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Structural operational semantics for weak bisimulations
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- A linear-time branching-time perspective on interface automata
This page was built for publication: Observation equivalence as a testing equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580965)
