Checking noninterference in Timed CSP

A well-established specification of noninterference in CSP is that, when high-level events are appropriately abstracted, the remaining low-level view is deterministic. This is not a workable definition in Timed CSP, where many processes cannot be refined to deterministic ones. We argue that in fact...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Formal aspects of computing 2013, Vol.25 (1), p.3-35
Hauptverfasser:	Roscoe, A. W., Huang, Jian
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Math Applications in Computer Science Original Article Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!