Verification of Infinite-State Systems
a decidable reachability problem such as reversal-bounded counter admit reachability sets effectively definable in Presburger arithmetic (assuming some.
DP DS b
Reasoning about Reversal-Bounded Counter Machines
ing that reachability sets are effectively definable in Presburger arithmetic. Exten- other decidability/complexity issues summarised as follows.
SD EORM
Reasoning about reversal-bounded counter machines
Reachability for Two-Counter Machines with One Test and One Reset
Dec 20 2018 Keywords and phrases Counter machine
FAST: acceleration from theory to practice - Sebastien Bardin Alain
Dec 10 2008 a Presburger definable reachability set. The techniques presented throughout the paper allow for model checking many counter systems (more ...
Witness Runs for Counter Machines⋆
the reachability sets are Presburger-definable as well as temporal logics Many subclasses of counter machines admit a decidable reachability.
Reachability for Two-Counter Machines with One Test and One Reset
Keywords and phrases Counter machine Vector addition system
LIPIcs FSTTCS
The Well Structured Problem for Presburger Counter Machines
Oct 4 2019 for most of the (Presburger-defined) counter machines except for Affine VASS of ... Section 4 studies the decidability of reachability and.
Reachability for Two-Counter Machines with One Test and One Reset
Keywords and phrases Counter machine Vector addition system
LIPIcs FSTTCS
PETRI NET REACHABILITY GRAPHS: DECIDABILITY STATUS OF
Oct 22 2012 clusion problem) between reachability sets defined by Petri nets