scientific article; zbMATH DE number 7559502
From MaRDI portal
Publication:5089313
DOI10.4230/LIPIcs.CONCUR.2020.46MaRDI QIDQ5089313
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2007.05789
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ Lower bounds on the state complexity of population protocols ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of population protocols
- A structure to decide reachability in Petri nets
- Parameterized model checking of rendezvous systems
- Projections of vector addition system reachability sets are semilinear
- The computational power of population protocols
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
- Semigroups, Presburger formulas, and languages
- Parameterized Model Checking of Token-Passing Systems
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- Parameterized Verification of Communicating Automata under Context Bounds
- On the Expressive Power of Communication Primitives in Parameterised Systems
- Parameterized Verification of Ad Hoc Networks
- An Algorithm for the General Petri Net Reachability Problem
- Reasoning about systems with many processes
- Vector Addition System Reversible Reachability Problem
- The reachability problem for Petri nets is not elementary
- Presburger Vector Addition Systems
- CONCUR 2004 - Concurrency Theory
- Vector addition system reachability problem
- Expressive Power of Broadcast Consensus Protocols
- Model checking parameterized asynchronous shared-memory systems
This page was built for publication:
