Verification of Immediate Observation Population Protocols
From MaRDI portal
DOI10.4230/LIPIcs.CONCUR.2018.31MaRDI QIDQ5009448
Rupak Majumdar, Chana Weil-Kennedy, Pierre Ganty, Javier Esparza
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1807.06071
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
The complexity of verifying population protocols, Population protocols with unreliable communication, Protocols with constant local storage and unreliable communication
Cites Work
- Unnamed Item
- Complexity results for 1-safe nets
- Complexity of some problems in Petri nets
- The covering and boundedness problems for vector addition systems
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Complexity Analysis of the Backward Coverability Algorithm for VASS
- Model Checking Population Protocols
- Verification of Population Protocols
- Computation in networks of passively mobile finite-state sensors