Verifying the correctness of parallel logical control algorithms

MaRDI QIDQ1111014zbMATH OpenFDO

Authors A. D. Zakrevskij

Publication date 1987

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

correctnessparallel logical control algorithmsPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Algorithms in computer science (68W99)

Review text

An algorithm of the type examined in the article is termed correct if it is compact, restorable, noncontradictory, stable, and self-consistent. Formal methods are proposed for verifying these properties, including Petri nets.

Recommendations

• scientific article; zbMATH DE number 4133475
• Parallel logical control algorithms: Verification and hardware implementation
• Verification of correctness of parallel algorithms in practice
• scientific article; zbMATH DE number 1751910
• On the correctness of parallel algorithms
• scientific article; zbMATH DE number 3890706
• A survey of verification techniques for parallel programs
• scientific article; zbMATH DE number 2021573

Cited in

(5)

• Parallel logical control algorithms: Verification and hardware implementation
• scientific article; zbMATH DE number 1670834 (Why is no real title available?)
• scientific article; zbMATH DE number 4133475 (Why is no real title available?)
• Verification of correctness of parallel algorithms in practice
• scientific article; zbMATH DE number 4187105 (Why is no real title available?)

This page was built for publication: Verifying the correctness of parallel logical control algorithms

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