scientific article; zbMATH DE number 7559502
From MaRDI portal
Publication:5089313
DOI10.4230/LIPICS.CONCUR.2020.46MaRDI QIDQ5089313FDOQ5089313
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2007.05789
Title of this publication is not available (Why is that?)
Cites Work
- Parameterized Model Checking of Token-Passing Systems
- Reasoning about systems with many processes
- CONCUR 2004 - Concurrency Theory
- Semigroups, Presburger formulas, and languages
- The computational power of population protocols
- Title not available (Why is that?)
- A structure to decide reachability in Petri nets
- Vector addition system reachability problem
- An Algorithm for the General Petri Net Reachability Problem
- Model checking parameterized asynchronous shared-memory systems
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- Vector Addition System Reversible Reachability Problem
- Verification of population protocols
- Presburger Vector Addition Systems
- Parameterized Verification of Ad Hoc Networks
- On the Expressive Power of Communication Primitives in Parameterised Systems
- Parameterized Verification of Communicating Automata under Context Bounds
- The reachability problem for Petri nets is not elementary
- Projections of vector addition system reachability sets are semilinear
- Parameterized model checking of rendezvous systems
- Expressive Power of Broadcast Consensus Protocols
- Title not available (Why is that?)
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
- Title not available (Why is that?)
Cited In (3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089313)
