Verification of Population Protocols

DOI10.4230/LIPICS.CONCUR.2015.470MaRDI QIDQ5357724zbMATH OpenOpenAlexFDO

Authors Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar

Publication date 12 September 2017

Full work available at URL https://hal.archives-ouvertes.fr/hal-02391875

zbMATH Keywords

parametrized verificationPetri netspopulation protocols

Mathematics Subject Classification ID

Network protocols (68M12) 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

• Verification of population protocols
• Model checking population protocols
• The complexity of verifying population protocols
• Verification of Immediate Observation Population Protocols
• Advances in parameterized verification of population protocols

Cited in

(14)

• Parameterized model checking of rendezvous systems
• The complexity of verifying population protocols
• Flat Petri nets (invited talk)
• Advances in parameterized verification of population protocols
• Existence of home states in Petri nets is decidable
• Model checking population protocols
• Verification of Immediate Observation Population Protocols
• Automatic analysis of expected termination time for population protocols
• Controlling a population
• Black Ninjas in the dark: formal analysis of population protocols
• Verification of population protocols
• Population protocols and related models
• Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
• Parameterized Analysis of Immediate Observation Petri Nets

This page was built for publication: Verification of Population Protocols

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