Reachability for two-counter machines with one test and one reset
From MaRDI portal
Publication:5090970
Recommendations
Cites work
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1500528 (Why is no real title available?)
- scientific article; zbMATH DE number 1759422 (Why is no real title available?)
- scientific article; zbMATH DE number 1405652 (Why is no real title available?)
- Analysis 1
- CONCUR 2004 - Concurrency Theory
- Hyper-Ackermannian bounds for pushdown vector addition systems
- Mixing coverability and reachability to analyze VASS with one zero-test
- On Petri nets with hierarchical special arcs
- On the reachability problem for 5-dimensional vector addition systems
- Place-boundedness for vector addition systems with one zero-test
- Reachability in Petri nets with inhibitor arcs
- Reachability in Succinct and Parametric One-Counter Automata
- Reachability in two-dimensional unary vector addition systems with states is NL-complete
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- The Reachability Problem for Vector Addition System with One Zero-Test
- Well-structured transition systems everywhere!
- What makes Petri nets harder to verify: stack or data?
Cited in
(4)
This page was built for publication: Reachability for two-counter machines with one test and one reset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090970)
