Checking noninterference in timed CSP
type: Item
instance of: scholarly article
title: Checking noninterference in timed CSP
zbMATH Open document ID: 1259.68132
author: A. W. Roscoe
author: Jian Huang
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6148352
zbMATH Keywords: CSP
zbMATH Keywords: timed CSP
zbMATH Keywords: noninterference
zbMATH Keywords: refinement
MaRDI profile type: Publication
full work available at URL: s00165-012-0251-6
OpenAlex ID: W2030009784
cites work: A theory of timed automata
cites work: Q3146271
cites work: Q4461952
cites work: Q2754157
cites work: On timed models and full abstraction
cites work: The Shadow Knows: Refinement of Ignorance in Sequential Programs
cites work: Q4472226
cites work: Q4457839
cites work: A timed model for communicating sequential processes
cites work: The timed failures -- Stability model for CSP
cites work: Confluence Thanks to Extensional Determinism
cites work: Understanding concurrent systems
DOI: 10.1007/S00165-012-0251-6
description: scientific article; zbMATH DE number 6148352