Communicating sequential processes
Communicating sequential processes
CCS + time = an interleaving model for real time systems
Proceedings of the 18th international colloquium on Automata, languages and programming
Transition system specifications with negative premises (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
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
Process Communication Environment
NAPAW '92 Proceedings of the First North American Process Algebra Workshop
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
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
An approach for network information flow analysis for systems of embedded components
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
| 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.