Approximating bisimulation in one-counter nets
Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 4, pp. 33-44

Voir la notice de l'article provenant de la source Math-Net.Ru

One-counter nets are finite-state machines operating on a variable (counter) which ranges over the natural numbers. Every transition can increase or decrease the value of the counter (the decrease is possible only if the result is non-negative, hence zero-testing is not allowed). The class of one-counter nets is equivalent to the class of Petri nets with one unbounded place, and to the class of pushdown automata where the stack alphabet contains one symbol. We present a specific method of approximation of the largest bisimulation of a one-counter net, based on the single-periodic arithmetics and a notion of stratified bisimulation.
Keywords: one-counter nets, Petri nets, single-periodic base.
Mots-clés : bisimulation
@article{MAIS_2011_18_4_a3,
     author = {V. A. Bashkin},
     title = {Approximating bisimulation in one-counter nets},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {33--44},
     publisher = {mathdoc},
     volume = {18},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a3/}
}
TY  - JOUR
AU  - V. A. Bashkin
TI  - Approximating bisimulation in one-counter nets
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2011
SP  - 33
EP  - 44
VL  - 18
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a3/
LA  - ru
ID  - MAIS_2011_18_4_a3
ER  - 
%0 Journal Article
%A V. A. Bashkin
%T Approximating bisimulation in one-counter nets
%J Modelirovanie i analiz informacionnyh sistem
%D 2011
%P 33-44
%V 18
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a3/
%G ru
%F MAIS_2011_18_4_a3
V. A. Bashkin. Approximating bisimulation in one-counter nets. Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 4, pp. 33-44. http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a3/