Verification of population protocols with unordered data
From MaRDI portal
Cites work
- Computation in networks of passively mobile finite-state sensors
- Decidability and complexity of Petri nets with unordered data
- Decidability of parameterized verification
- Fast and succinct population protocols for Presburger arithmetic
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- Nets with Tokens Which Carry Data
- Parameterized Analysis of Immediate Observation Petri Nets
- Parameterized analysis of reconfigurable broadcast networks
- Parameterized broadcast networks with registers: from NP to the frontiers of decidability
- Population protocols with unordered data
- Population protocols: beyond runtime analysis
- Reachability in networks of register protocols under stochastic schedulers
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- Recent results in population protocols for exact majority and leader election
- Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent
- The complexity of verifying population protocols
- The computational power of population protocols
- The reachability problem for Petri nets is not primitive recursive
- The semilinear home-space problem is Ackermann-complete for Petri nets
- Time-space trade-offs in population protocols
- Towards efficient verification of population protocols
- Undecidability of bisimilarity for Petri nets and some related problems
- Verification of population protocols
- Verification of population protocols with unordered data
Cited in
(2)
This page was built for publication: Verification of population protocols with unordered data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875020)
