Pages that link to "Item:Q580965"
From MaRDI portal
The following pages link to Observation equivalence as a testing equivalence (Q580965):
Displaying 49 items.
- A characterization of finitary bisimulation (Q287256) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Refusal testing (Q580961) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Bisimulation and divergence (Q750163) (← links)
- CSP is a retract of CCS (Q960852) (← links)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- Specification styles in distributed systems design and verification (Q1177943) (← links)
- Observational structures and their logic (Q1190494) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- TIC: a tImed calculus (Q1261314) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Domain theory, testing and simulation for labelled Markov processes (Q1770416) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
- Corrigendum: ``A domain equation for bisimulation'' by S. Abramsky (Q1854414) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- A linear-time branching-time perspective on interface automata (Q2182669) (← links)
- Limited approximate bisimulations and the corresponding rough approximations (Q2237122) (← links)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← links)
- Bisimulation on speed: a unified approach (Q2503326) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Labelled Markov processes as generalised stochastic relations (Q2864159) (← links)
- A hierarchy of reverse bisimulations on stable configuration structures (Q2883121) (← links)
- Connection between logical and algebraic approaches to concurrent systems (Q3060196) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- Modelling Divergence in Relational Concurrent Refinement (Q3605466) (← links)
- Quantales, observational logic and process semantics (Q4279244) (← links)
- Testing for a conformance relation based on acceptance (Q5044759) (← links)
- Testability of a communicating system through an environment (Q5044760) (← links)
- Deciding bisimulation equivalences for a class of non-finite-state programs (Q5096175) (← links)
- Generating diagnostic information for behavioral preorders (Q5137006) (← links)
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems (Q5458058) (← links)
- Termination, deadlock and divergence (Q5887521) (← links)
- Quantales, finite observations and strong bisimulation (Q5940918) (← links)
- A fully abstract denotational semantics for the calculus of higher-order communicating systems (Q5940933) (← links)
- On implementations and semantics of a concurrent programming language (Q6044131) (← links)
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces (Q6116581) (← links)
- On relating concurrency and nondeterminism (Q6116582) (← links)
- The mays and musts of concurrent strategies (Q6612785) (← links)
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)