Pages that link to "Item:Q1941887"
From MaRDI portal
The following pages link to Checking noninterference in timed CSP (Q1941887):
Displaying 8 items.
- A hierarchy of failures-based models: theory and application (Q1763727) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- On CSP refinement tests that run multiple copies of a process (Q2810978) (← links)
- Timed CSP = closed timed automata (Q2842610) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- (Q4461952) (← links)
- May Testing, Non-interference, and Compositionality (Q4923384) (← links)