CONCUR 2005 – Concurrency Theory
DOI10.1007/11539452zbMATH Open1134.68340OpenAlexW1737342522MaRDI QIDQ5897495FDOQ5897495
Authors: Adrian Francalanza, Matthew Hennessy
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11539452
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (9)
- A theory of system behaviour in the presence of node and link failure
- An observational theory for mobile ad hoc networks (full version)
- Adding recursion to Dpi
- Basic observables for a calculus for global computing
- A type theory for robust failure handling in distributed systems
- A calculus of quality for robustness against unreliable communication
- Extensionality of spatial observations in distributed systems
- An Observational Theory for Mobile Ad Hoc Networks
- A theory for observational fault tolerance
Uses Software
This page was built for publication: CONCUR 2005 – Concurrency Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897495)