On describing the behavior and implementation of distributed systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3463159 (Why is no real title available?)
- scientific article; zbMATH DE number 795666 (Why is no real title available?)
- Concurrent Processes and Their Syntax
- Operating Experience with ALGOL 60
- Software Descriptions with Flow Expressions
- Specification and Proof Techniques for Serializers
Cited in
(15)- Action systems in incremental and aspect-oriented modeling
- The origins of structural operational semantics
- Hundreds of impossibility results for distributed computing
- Global serializability of concurrent programs
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- A complexity theory of efficient parallel algorithms
- Some perspectives on PODC
- Fast asynchronous systems in dense time
- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
- Faster asynchronous systems.
- Modelling knowledge and action in distributed systems
- On the complexity of computation in the presence of link failures: The case of a ring
- Electing a leader in a ring with link failures
- A lower bound for the time to assure interactive consistency
- On the message complexity of distributed problems
This page was built for publication: On describing the behavior and implementation of distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143167)
