Pages that link to "Item:Q2576581"
From MaRDI portal
The following pages link to On the expressive power of CSP refinement (Q2576581):
Displaying 12 items.
- Static slicing of explicitly synchronized languages (Q418185) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Denotational semantics of CSP (Q801677) (← links)
- Verifying data refinements using a model checker (Q851129) (← links)
- Specification of communicating processes: temporal logic versus refusals-based refinement (Q931435) (← links)
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) (Q1318721) (← links)
- On the limits of refinement-testing for model-checking CSP (Q1941896) (← links)
- The expressiveness of CSP with priority (Q2520703) (← links)
- On CSP refinement tests that run multiple copies of a process (Q2810978) (← links)
- (Q3989946) (← links)
- (Q4737562) (← links)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)