On a class of counter machines
Modelirovanie i analiz informacionnyh sistem, Tome 16 (2009) no. 2, pp. 75-82
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper we propose abstract counter machines as a general framework for analysing state systems with counters. We use this framework to define weak counter machines and a new class of counter machines — automaton counter machines which can be modeled by Communicating Coloured Automata (introduced in [11]). Particular emphasis has been placed on comparing automaton counter machines with weak counter machines which can be modeled by Petri nets. We show undecidability of boundedness, inclusion, equivalence and a special case of reachability for automaton counter machines. This implies that the same holds for Communicating Colouring Automata.
Keywords:
abstract counter machines, automaton counter machine, Communicating Colouring Automata, verification, decidability.
@article{MAIS_2009_16_2_a2,
author = {E. V. Kuzmin and D. Yu. Chalyy},
title = {On a class of counter machines},
journal = {Modelirovanie i analiz informacionnyh sistem},
pages = {75--82},
publisher = {mathdoc},
volume = {16},
number = {2},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MAIS_2009_16_2_a2/}
}
E. V. Kuzmin; D. Yu. Chalyy. On a class of counter machines. Modelirovanie i analiz informacionnyh sistem, Tome 16 (2009) no. 2, pp. 75-82. http://geodesic.mathdoc.fr/item/MAIS_2009_16_2_a2/