Verification of Population Protocols

DOI10.4230/LIPIcs.CONCUR.2015.470zbMath1374.68326OpenAlexW2274165758MaRDI QIDQ5357724

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

Publication date: 12 September 2017

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

zbMATH Keywords

Petri netspopulation protocolsparametrized verification

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

Related Items (8)

Existence of home states in Petri nets is decidable ⋮ Parameterized model checking of rendezvous systems ⋮ Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks ⋮ Parameterized Analysis of Immediate Observation Petri Nets ⋮ Verification of Immediate Observation Population Protocols ⋮ Unnamed Item ⋮ Towards efficient verification of population protocols ⋮ Flat Petri nets (invited talk)

This page was built for publication: Verification of Population Protocols