Observation equivalence as a testing equivalence

DOI10.1016/0304-3975(87)90065-XzbMATH Open0626.68016DBLPjournals/tcs/Abramsky87OpenAlexW2167004912WikidataQ57006959 ScholiaQ57006959MaRDI QIDQ580965FDOQ580965

Samson Abramsky

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90065-x

Recommendations

• Extensional equivalences for transition systems
• scientific article; zbMATH DE number 3956420
• Trace, failure and testing equivalences for communicating processes
• Refusal testing
• Testing equivalence as a bisimulation equivalence

zbMATH Keywords

testingconcurrencydenotational semanticspowerdomainsoperational semanticstransition systems with divergence

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Bisimulation can't be traced
• A calculus of communicating systems
• A Powerdomain Construction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (51)

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

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)