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