Petri net based verification of distributed algorithms: An example
From MaRDI portal
(Redirected from Petri net based verification of distributed algorithms: An example)
Recommendations
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A principle for sequential reasoning about distributed algorithms
- Distributed network protocols
- scientific article; zbMATH DE number 3956427 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 47016 (Why is no real title available?)
- scientific article; zbMATH DE number 50008 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- Proving nonreachability by modulo-invariants
Cited in
(7)- A multi-level approach for modelling distributed agent network
- scientific article; zbMATH DE number 1101604 (Why is no real title available?)
- scientific article; zbMATH DE number 1106703 (Why is no real title available?)
- Algebraic nets with flexible arcs
- A compositional partial order semantics for Petri net components
- Flexibility in Algebraic Nets
- ESTL: A Temporal Logic for Events and States
This page was built for publication: Petri net based verification of distributed algorithms: An example
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377301)