A method for the verification of a distributed and synchronized algorithm

DOI10.1080/00207540412331312679MaRDI QIDQ4671275zbMATH OpenOpenAlexFDO

Authors Frédéric Magniette, Laurence Pilard, Brigitte Rozoy

Publication date 26 April 2005

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540412331312679

Mathematics Subject Classification ID

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

• Parameterized model checking of synchronous distributed algorithms by abstraction
• Using Bounded Model Checking to Verify Consensus Algorithms
• A strategy for automatic verification of stabilization of distributed algorithms
• Distributed symbolic bounded property checking
• An automata-theoretic approach to the verification of distributed algorithms

Cites work

• scientific article; zbMATH DE number 1361116 (Why is no real title available?)
• Concurrent and maximally concurrent evolution of nonsequential systems
• Model checking using net unfoldings
• Symbolic model checking: \(10^{20}\) states and beyond

This page was built for publication: A method for the verification of a distributed and synchronized algorithm

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