On the complexity of some extended word problems defined by cancellation rules
Information Processing Letters
Theoretical Computer Science
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Unreliable channels are easier to verify than perfect channels
Information and Computation
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Journal of Computer and System Sciences
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Well-Abstracted Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We present a global and comprehensive view of the properties of subclasses of two counters automata for which counters are only accessed through the following operations: increment (+1), decrement (-1), reset (c := 0), transfer (the whole content of counter c is transfered into counter c′), and testing for zero. We first extend Hopcroft-Pansiot's result (an algorithm for computing a finite description of the semilinear set post*) to two counters automata with only one test for zero (and one reset and one transfer operations). Then, we prove the semilinearity and the computability of pre* for the subclass of 2 counters automata with one test for zero on c1, two reset operations and one transfer from c1 to c2. By proving simulations between subclasses, we show that this subclass is the maximal class for which pre* is semilinear and effectively computable. All the (effective) semilinearity results are obtained with the help of a new symbolic reachability tree algorithm for counter automata using an Acceleration function. When Acceleration has the so-called stability property, the constructed tree computes exactly the reachability set.