Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
An efficiency preorder for processes
Acta Informatica
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
A Distributed Pi-Calculus
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Molecular Biology Done in CCS-R
Electronic Notes in Theoretical Computer Science (ENTCS)
Basic observables for a calculus for global computing
Information and Computation
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Distributed Systems and Their Environments
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Network Conscious π-calculus: A Concurrent Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
A type system for counting instances of software components
Theoretical Computer Science
Hi-index | 0.00 |
We design a new variation on the picalculus, @p"c"o"s"t, in which the use of channels or resources must be paid for. Processes operate relative to a cost environment, and communications can only happen if principals have provided sufficient funds for the channels associated with the communications. We define a bisimulation-based behavioural preorder in which two processes are related if, intuitively, they exhibit the same behaviour but one may be more efficient than the other. We justify our choice of preorder by proving that it is characterised by three intuitive properties which behavioural preorders should satisfy in a framework in which the use of resources must be funded.