Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
Full abstraction of a real-time denotational semantics for an OCCAM-like language
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The timed failures-stability model for CSP
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Digitisation and Full Abstraction for Dense-Time Model Checking
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Defining information flow quantity
Journal of Computer Security - Special issue on CSFW15
Modeling and Verifying Time Sensitive Security Protocols with Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper we study a denotational model for a discrete-time version of CSP. We give a compositional semantics for the language. The model records refusal information at the end of each time unit; we believe this model to be simpler than existing models. We also show that the model is fully abstract: equivalence in the model corresponds to the natural equivalence of may testing; and all members of the denotational model are syntactically expressible. We also consider a slightly weaker model, containing no refusal information; we show that this model corresponds to an alternative form of may testing. We briefly discuss the application of these models to the study of information flow in multi-level secure systems.