|
Modelirovanie i Analiz Informatsionnykh Sistem, 2011, Volume 18, Number 4, Pages 33–44
(Mi mais196)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Approximating bisimulation in one-counter nets
V. A. Bashkin P. G. Demidov Yaroslavl State University
Abstract:
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, bisimulation, single-periodic base.
Received: 29.09.2011
Citation:
V. A. Bashkin, “Approximating bisimulation in one-counter nets”, Model. Anal. Inform. Sist., 18:4 (2011), 33–44
Linking options:
https://www.mathnet.ru/eng/mais196 https://www.mathnet.ru/eng/mais/v18/i4/p33
|
Statistics & downloads: |
Abstract page: | 310 | Full-text PDF : | 102 | References: | 60 |
|