Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter [chapter]

Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
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
more » ... e § -Presburger-always problem. These results can be used to formulate a weak form of Presburger linear temporal logic and develop its model-checking theories for NCMFs. They can also be combined with [12] to study the same set of liveness problems on an extended form of discrete timed automata containing, besides clocks, a number of reversalbounded counters and a free counter.
doi:10.1007/3-540-45294-x_12 fatcat:kbopen22jjgatglczw6pr5myhq