Checking noninterference in timed CSP

DOI10.1007/S00165-012-0251-6zbMATH Open1259.68132OpenAlexW2030009784MaRDI QIDQ1941887FDOQ1941887

Authors: A. W. Roscoe, Jian Huang 

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

Recommendations

• scientific article; zbMATH DE number 2064461
• Timed CSP = closed timed automata
• scientific article; zbMATH DE number 1799514
• Synthesis of Non-Interferent Timed Systems
• Formal Modeling and Analysis of Timed Systems

zbMATH Keywords

CSPrefinementnoninterferencetimed CSP

Mathematics Subject Classification ID

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

Cites Work

• A theory of timed automata
• A timed model for communicating sequential processes
• Understanding concurrent systems
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Process algebra and model checking
• Translating between models of concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)