Checking noninterference in timed CSP
From MaRDI portal
Publication:1941887
DOI10.1007/s00165-012-0251-6zbMath1259.68132MaRDI QIDQ1941887
Publication date: 22 March 2013
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-012-0251-6
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
A hierarchy of failures-based models: theory and application, An efficient algorithm for computing bisimulation equivalence
Cites Work
- A timed model for communicating sequential processes
- The timed failures -- Stability model for CSP
- A theory of timed automata
- Understanding concurrent systems
- The Shadow Knows: Refinement of Ignorance in Sequential Programs
- Confluence Thanks to Extensional Determinism
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item