Reachability for two-counter machines with one test and one reset
From MaRDI portal
Publication:5090970
DOI10.4230/LIPICS.FSTTCS.2018.31MaRDI QIDQ5090970FDOQ5090970
Authors: Jérôme Leroux, Grégoire Sutre, Alain Finkel 
Publication date: 21 July 2022
Recommendations
formal verificationreachability problemPresburger arithmeticcounter machinevector addition systeminfinite-state system
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- Title not available (Why is that?)
- CONCUR 2004 - Concurrency Theory
- Well-structured transition systems everywhere!
- On the reachability problem for 5-dimensional vector addition systems
- The Reachability Problem for Vector Addition System with One Zero-Test
- Mixing coverability and reachability to analyze VASS with one zero-test
- Reachability in Petri nets with inhibitor arcs
- Reachability in Succinct and Parametric One-Counter Automata
- Title not available (Why is that?)
- What makes Petri nets harder to verify: stack or data?
- Reachability in two-dimensional unary vector addition systems with states is NL-complete
- On Petri nets with hierarchical special arcs
- Hyper-Ackermannian bounds for pushdown vector addition systems
- Title not available (Why is that?)
- Place-boundedness for vector addition systems with one zero-test
- Analysis 1
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)
