Refusal testing
From MaRDI portal
Publication:580961
DOI10.1016/0304-3975(87)90117-4zbMath0626.68011OpenAlexW2913048148MaRDI QIDQ580961
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)90117-4
Related Items (29)
Sound reasoning in \textit{tock}-CSP ⋮ Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ From π-calculus to higher-order π-calculus — and back ⋮ Timed testing of concurrent systems ⋮ Quantales, observational logic and process semantics ⋮ Responsiveness and stable revivals ⋮ Translating between models of concurrency ⋮ A Unary Semigroup Trace Algebra ⋮ Theory of interaction ⋮ Removing redundant refusals: minimal complete test suites for failure trace semantics ⋮ Component-aware input-output conformance ⋮ Specification of communicating processes: temporal logic versus refusals-based refinement ⋮ On deciding some equivalences for concurrent processes ⋮ Reducing complex CSP models to traces via priority ⋮ Proof systems for infinite behaviours ⋮ Experimenting with process equivalence ⋮ Interaction semantics with refusals, divergence, and destruction ⋮ May Testing, Non-interference, and Compositionality ⋮ Relating fair testing and accordance for service replaceability ⋮ Quantales, finite observations and strong bisimulation ⋮ Fast asynchronous systems in dense time ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ A formal abstract framework for modelling and testing complex software systems ⋮ Modular specification of process algebras ⋮ Revivals, stuckness and the hierarchy of CSP models ⋮ Timed CSP = Closed Timed Automata1 ⋮ Slow Abstraction via Priority ⋮ Ordered SOS process languages for branching and eager bisimulations ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Cites Work
- Modal logics for communicating systems
- Observation equivalence as a testing equivalence
- A calculus of communicating systems
- Process algebra for synchronous communication
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Refusal testing
