Observation equivalence as a testing equivalence

From MaRDI portal
Revision as of 07:27, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:580965

DOI10.1016/0304-3975(87)90065-XzbMath0626.68016DBLPjournals/tcs/Abramsky87OpenAlexW2167004912WikidataQ57006959 ScholiaQ57006959MaRDI QIDQ580965

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




Related Items (49)

A hierarchy of reverse bisimulations on stable configuration structuresProcess languages with discrete relative time based on the ordered SOS format and rooted eager bisimulationTermination, deadlock and divergenceA characterization of finitary bisimulationTesting for a conformance relation based on acceptanceTestability of a communicating system through an environmentOn the operational semantics of nondeterminism and divergenceQuantales, observational logic and process semanticsA domain equation for bisimulationTrace, failure and testing equivalences for communicating processesTesting probabilistic equivalence through reinforcement learningA uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalencesA linear-time branching-time perspective on interface automataA general conservative extension theorem in process algebras with inequalitiesOn implementations and semantics of a concurrent programming languageReverse bisimilarity vs. forward bisimilarityTrade-offs in true concurrency: Pomsets and mazurkiewicz tracesOn relating concurrency and nondeterminismBranching vs. Linear Time: Semantical PerspectiveGoodbye iocoGenerating diagnostic information for behavioral preordersBisimulation through probabilistic testingSpecification styles in distributed systems design and verificationStructural operational semantics for weak bisimulationsLimited approximate bisimulations and the corresponding rough approximationsObservational structures and their logicExperimenting with process equivalenceTransition system specifications with negative premisesStructured operational semantics and bisimulation as a congruenceCSP is a retract of CCSRelating strong behavioral equivalences for processes with nondeterminism and probabilitiesQuantales, finite observations and strong bisimulationA fully abstract denotational semantics for the calculus of higher-order communicating systemsDomain theory, testing and simulation for labelled Markov processesRefusal testingBisimulation on speed: a unified approachAn axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relationModelling Divergence in Relational Concurrent RefinementConnection between logical and algebraic approaches to concurrent systemsA survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systemsTIC: a tImed calculusBisimulation and divergenceDeciding bisimulation equivalences for a class of non-finite-state programsFinite axiom systems for testing preorder and De Simone process languagesProcesses against tests: on defining contextual equivalencesCorrigendum: ``A domain equation for bisimulation by S. AbramskyOrdered SOS process languages for branching and eager bisimulationsLabelled Markov Processes as Generalised Stochastic RelationsTesting preorders for probabilistic processes can be characterized by simulations



Cites Work




This page was built for publication: Observation equivalence as a testing equivalence