The following pages link to Fair testing (Q865623):
Displaying 29 items.
- Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← links)
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
- Trace- and failure-based semantics for responsiveness (Q478516) (← links)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- Closures of may-, should- and must-convergences for contextual equivalence (Q991760) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- A fixed-points based framework for compliance of behavioural contracts (Q2035654) (← links)
- All congruences below stability-preserving fair testing or CFFD (Q2182664) (← links)
- Fair refinement for asynchronous session types (Q2233400) (← links)
- On constructibility and unconstructibility of LTS operators from other LTS operators (Q2340256) (← links)
- Keep it fair: equivalence and composition (Q2423741) (← links)
- On projecting processes into session types (Q2883119) (← links)
- Compliance in Behavioural Contracts: A Brief Survey (Q3460865) (← links)
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
- A theory of contracts for strong service compliance (Q3636912) (← links)
- Stubborn Sets, Frozen Actions, and Fair Testing (Q4989170) (← links)
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types (Q5043586) (← links)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- Observing Success in the Pi-Calculus (Q5240185) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- Sub-behaviour relations for session-based client/server systems (Q5740659) (← links)
- Fair subtyping for multi-party session types (Q5741567) (← links)
- Modelling session types using contracts (Q5741570) (← links)
- Fair asynchronous session subtyping (Q6635515) (← links)
- Minimal translations from synchronous communication to synchronizing locks (Q6643748) (← links)
