Communicating sequential processes
Communicating sequential processes
Data communications, computer networks and open systems (4th ed.)
Data communications, computer networks and open systems (4th ed.)
Communication and Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Process Communication Environment
NAPAW '92 Proceedings of the First North American Process Algebra Workshop
Transition System Specifications with Negative Premises (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Network Topology and a Case Study in TCOZ
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Using CSP to verify sequential consistency
Distributed Computing - Special issue: Verification of lazy caching
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Information-flow attacks based on limited observations
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Hi-index | 0.00 |
Critical issues that arise when process algebras are used for protocol specifications are discussed. To overcome some of these problems, a process algebra for protocol specifications is presented. It is based on Milner's Calculus of Communicating Systems, which is enriched by time and network reasoning. Several bisimulation based semantics for the calculus are defined and their properties are discussed.