On describing the behavior and implementation of distributed systems

DOI10.1016/0304-3975(81)90109-2zbMath0441.68020OpenAlexW2176413683MaRDI QIDQ1143167

Michael J. Fischer, Nancy A. Lynch

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90109-2

zbMATH Keywords

distributed systems

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

The origins of structural operational semantics, Faster asynchronous systems., A complexity theory of efficient parallel algorithms, A lower bound for the time to assure interactive consistency, Some perspectives on PODC, Hundreds of impossibility results for distributed computing, Action systems in incremental and aspect-oriented modeling, Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory, Fast asynchronous systems in dense time, On the message complexity of distributed problems, Modelling knowledge and action in distributed systems, Rapid convergence of a local load balancing algorithm for asynchronous rings, On the complexity of computation in the presence of link failures: The case of a ring, Global serializability of concurrent programs, Electing a leader in a ring with link failures

Cites Work

• Unnamed Item
• Unnamed Item
• Operating Experience with ALGOL 60
• Software Descriptions with Flow Expressions
• Specification and Proof Techniques for Serializers
• Concurrent Processes and Their Syntax