The following pages link to Refusal testing (Q580961):
Displaying 20 items.
- A formal abstract framework for modelling and testing complex software systems (Q714878) (← links)
- Theory of interaction (Q896903) (← links)
- Specification of communicating processes: temporal logic versus refusals-based refinement (Q931435) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- Proof systems for infinite behaviours (Q1193598) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Interaction semantics with refusals, divergence, and destruction (Q1758683) (← links)
- Modular specification of process algebras (Q1802074) (← 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)
- Sound reasoning in \textit{tock}-CSP (Q2120813) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- Responsiveness and stable revivals (Q2642988) (← links)
- Removing redundant refusals: minimal complete test suites for failure trace semantics (Q2687991) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- Slow Abstraction via Priority (Q2842644) (← links)
