A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Reachability Analysis for Some Models of Infinite-State Transition Systems
[chapter]

2000
*
Lecture Notes in Computer Science
*

We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversal-bounded counters (i.e. each counter can be incremented or decremented by 1 and tested for zero, but the number of times it can change mode from nondecreasing to nonincreasing and vice-versa is bounded by a constant, independent of the computation). We extend a CM by augmenting it with

doi:10.1007/3-540-44618-4_15
fatcat:fyws5qzlkrbqreoekyxxjj3qxu