Checking noninterference in timed CSP
From MaRDI portal
Publication:1941887
Recommendations
Cites work
- scientific article; zbMATH DE number 1670837 (Why is no real title available?)
- scientific article; zbMATH DE number 1799514 (Why is no real title available?)
- scientific article; zbMATH DE number 2059569 (Why is no real title available?)
- scientific article; zbMATH DE number 2064461 (Why is no real title available?)
- scientific article; zbMATH DE number 2080039 (Why is no real title available?)
- A theory of timed automata
- A timed model for communicating sequential processes
- Confluence thanks to extensional determinism
- On timed models and full abstraction
- The Shadow Knows: Refinement of Ignorance in Sequential Programs
- The timed failures -- Stability model for CSP
- Understanding concurrent systems
Cited in
(9)- Process algebra and model checking
- Translating between models of concurrency
- scientific article; zbMATH DE number 1799514 (Why is no real title available?)
- scientific article; zbMATH DE number 2064461 (Why is no real title available?)
- Timed CSP = closed timed automata
- On CSP refinement tests that run multiple copies of a process
- An efficient algorithm for computing bisimulation equivalence
- A hierarchy of failures-based models: theory and application
- May testing, non-interference, and compositionality
This page was built for publication: Checking noninterference in timed CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941887)