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

On the proof of a distributed algorithm

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

DOI10.1016/0020-0190(87)90123-2zbMath0653.68009OpenAlexW2151305625MaRDI QIDQ1107973

J. Pierre Verjus

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90123-2


zbMATH Keywords

distributed algorithmtermination detection


Mathematics Subject Classification ID

Theory of operating systems (68N25) Algorithms in computer science (68W99)


Related Items (1)

Comments on ``On the proof of a distributed algorithm: Always-true is not invariant




Cites Work

  • Derivation of a termination detection algorithm for distributed computations




This page was built for publication: On the proof of a distributed algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1107973&oldid=13145063"
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 02:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki