Abstract
We consider automata with counters whose values are updated according to signals sent by the environment. A transition can be fired only if the values of the counters satisfy some guards (the guards of the transition). We consider guards of the form yi#yj + Cij where yi is either x′i or x i, the values of the counter i respectively after and before the transition, and # is any relational symbol in {=,≤,≥,>,
Cite
CITATION STYLE
Comon, H., & Jurski, Y. (1998). Multiple counters automata, safety analysis and presburger arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1427 LNCS, pp. 268–279). Springer Verlag. https://doi.org/10.1007/bfb0028751
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.