Checking noninterference in timed CSP

DOI10.1007/s00165-012-0251-6zbMath1259.68132OpenAlexW2030009784MaRDI QIDQ1941887

Jian Huang, A. W. Roscoe

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

zbMATH Keywords

noninterferenceCSPrefinementtimed CSP

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

An efficient algorithm for computing bisimulation equivalence, Process Algebra and Model Checking, Translating between models of concurrency, A hierarchy of failures-based models: theory and application, On CSP Refinement Tests That Run Multiple Copies of a Process

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