Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An assertional proof of Rana's algorithm

From MaRDI portal
Publication:1318748
Jump to:navigation, search

DOI10.1016/0020-0190(94)90059-0zbMath0795.68081OpenAlexW2095125772MaRDI QIDQ1318748

Michiel C. van Wezel, Gerard Tel

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90059-0


zbMATH Keywords

livenesssafetydistributed computingprogram correctnesscorrectness prooftermination detection algorithm


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)





Cites Work

  • An assertional correctness proof of a distributed algorithm
  • Self-stabilizing extensions for message-passing systems
  • Distributed termination detection for dynamic systems
  • A distributed solution of the distributed termination problem
  • Derivation of a termination detection algorithm for distributed computations
  • Time, clocks, and the ordering of events in a distributed system




This page was built for publication: An assertional proof of Rana's algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1318748&oldid=13435759"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki