Answers are grounded in this paper and cite their sources.
A new model of multicounter machines is introduced where testing the counter status of a counter is optional, rather than existing models where they are always either required (traditional multicounter machines) or no status can be checked (partially-blind multicounter machines). If, in every accepting computation, each counter has a bounded number of occurrences where its status is tested and verified to be zero, then the machine is called finite-testable . One-way nondeterministic finite-testable multicounter machines are shown to be equivalent to partially-blind multicounter machines. However, one-way deterministic finite-testable multicounter machines are strictly more powerful than deterministic partially-blind machines. Interestingly, one-way deterministic finite-testable multicounter machines are shown to have a decidable containment problem. This makes it the most general known model where this problem is decidable, making the class important in the areas of model checking and formal verification. We also study properties of their reachability sets.
No takes yet. Share an insight, caveat, or question.
Ibarra et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: