scientific article; zbMATH DE number 7559502
From MaRDI portal
Publication:5089313
Cites work
- scientific article; zbMATH DE number 1954380 (Why is no real title available?)
- scientific article; zbMATH DE number 7649940 (Why is no real title available?)
- A structure to decide reachability in Petri nets
- An Algorithm for the General Petri Net Reachability Problem
- CONCUR 2004 - Concurrency Theory
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
- Controlling a population
- Expressive Power of Broadcast Consensus Protocols
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- On the Expressive Power of Communication Primitives in Parameterised Systems
- Parameterized Model Checking of Token-Passing Systems
- Parameterized Verification of Communicating Automata under Context Bounds
- Parameterized model checking of rendezvous systems
- Parameterized verification of ad hoc networks
- Presburger vector addition systems
- Projections of vector addition system reachability sets are semilinear
- Reasoning about systems with many processes
- Semigroups, Presburger formulas, and languages
- The computational power of population protocols
- The reachability problem for Petri nets is not elementary
- Vector addition system reachability problem, a short self-contained proof
- Vector addition system reversible reachability problem
- Verification of population protocols
Cited in
(2)
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)