Achieving Distributed Termination without Freezing

DOI10.1109/TSE.1982.235257MaRDI QIDQ3936178zbMATH OpenOpenAlexFDO

Authors 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 analysiscorrectness proofdistributed programsdistributed termination

Mathematics Subject Classification ID

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

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936178)