Verification of distributed algorithms with algebraic Petri nets

DOI10.1007/BFB0052094MaRDI QIDQ4371026zbMATH OpenFDO

Authors Wolfgang Reisig, Ekkart Kindler

Publication date 7 January 1998

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

Full work available at URL https://doi.org/10.1007/BFB0052094

zbMATH Keywords

distributed algorithmsPetri net

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Petri net based verification of distributed algorithms: An example
• Elements of distributed algorithms. Modeling and analysis with Petri nets
• Modelling and verification of Distributed Algorithms
• Sequential and distributed model checking of Petri net specifications

Cited in

(10)

• Petri net based verification of distributed algorithms: An example
• A computer checked algebraic verification of a distributed summation algorithm
• Structuring and verifying distributed algorithms
• scientific article; zbMATH DE number 2064469 (Why is no real title available?)
• Verifying parallel algorithms and programs using coloured Petri nets
• Verification techniques for a network algebra
• Concurrency based transition refinement for the verification of distributed algorithms
• Algebraic nets with flexible arcs
• Verification of siphons and traps for algebraic Petri nets
• Flexibility in Algebraic Nets

This page was built for publication: Verification of distributed algorithms with algebraic Petri nets

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