A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
[chapter]
2001
Lecture Notes in Computer Science
We investigate the Presburger liveness problems for nondeterministic reversal-bounded multicounter machines with a free counter (NCMFs). We show the following: -The § -Presburger-i.o. problem and the § -Presburger-eventual problem are both decidable. So are their duals, the¨-Presburger-almost-always problem and the¨-Presburger-always problem. -The¨-Presburger-i.o. problem and the¨-Presburger-eventual problem are both undecidable. So are their duals, the § -Presburger-almost-always problem and
doi:10.1007/3-540-45294-x_12
fatcat:kbopen22jjgatglczw6pr5myhq