Achieving Distributed Termination without Freezing

DOI10.1109/TSE.1982.235257zbMath0478.68024OpenAlexW2028827156MaRDI QIDQ3936178

Nissim Francez, Michael Rodeh

Publication date: 1982

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1982.235257

zbMATH Keywords

communicationconcurrencycomplexity analysisdistributed programscorrectness proofdistributed termination

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (7)

Transformations for communication fairness in CSP ⋮ A distributed algorithm for distributed termination ⋮ On distributed snapshots ⋮ A fully distributed termination detection scheme ⋮ Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms ⋮ Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP ⋮ A distributed solution of the distributed termination problem

This page was built for publication: Achieving Distributed Termination without Freezing