Counting the Cost in the Picalculus (Extended Abstract)
From MaRDI portal
Publication:5166616
DOI10.1016/j.entcs.2009.06.042zbMath1291.68288MaRDI QIDQ5166616
Manish Gaur, Matthew C. B. Hennessy
Publication date: 27 June 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.042
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Network-conscious \(\pi\)-calculus -- a model of Pastry, A type system for counting instances of software components, A network-conscious \(\pi\)-calculus and its coalgebraic semantics, Network Conscious π-calculus: A Concurrent Semantics, Employing Costs in Multiagent Systems with Timed Migration and Timed Communication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theory of system behaviour in the presence of node and link failure
- Calculi for synchrony and asynchrony
- A calculus for cryptographic protocols: The spi calculus
- An efficiency preorder for processes
- Mobile ambients
- Web services. Concepts, architectures and applications
- Basic observables for a calculus for global computing
- Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
- A theory of contracts for web services
- A Distributed Pi-Calculus
- The Must Preorder Revisited
- Algebra and logic for resource-based systems modelling
- Algebraic laws for nondeterminism and concurrency
- The Logic of Bunched Implications
- Typed behavioural equivalences for processes in the presence of subtyping
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Foundations of Software Science and Computational Structures
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
