scientific article; zbMATH DE number 19769

DOI10.1007/3-540-53414-8_38MaRDI QIDQ3979267zbMATH OpenFDO

Authors Dominik Gomm, Rolf Walter

Publication date 26 June 1992

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53414-8_38

zbMATH Keywords

diffusing computationdiffusion protocoldistributed termination problemPetri netstable condition

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

[For the entire collection see Zbl 0732.00023.] The distributed termination problem is specified as a property of a Petri net for an arbitrary distributed computation. A solution is given by two net extensions. We begin with a protocol for computing a stable meaningful condition. Then a diffusion protocol is specified to visit all processes. Thereby the stable condition is used as a delay. Both protocols together are verified to detect distributed termination always and correctly.

Recommendations

• scientific article; zbMATH DE number 4045166
• scientific article; zbMATH DE number 3926219
• scientific article; zbMATH DE number 4020457
• Correctness proofs of distributed termination algorithms
• Distributed termination on a ring

Cited in

(3)

• scientific article; zbMATH DE number 3926219 (Why is no real title available?)
• scientific article; zbMATH DE number 4020457 (Why is no real title available?)
• scientific article; zbMATH DE number 4045166 (Why is no real title available?)

This page was built for publication:

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