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
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.
one-counter nets, Petri nets, bisimulation, single-periodic base.
PDF file (367 kB)
V. A. Bashkin, “Approximating bisimulation in one-counter nets”, Model. Anal. Inform. Sist., 18:4 (2011), 33–44
Citation in format AMSBIB
\paper Approximating bisimulation in one-counter nets
\jour Model. Anal. Inform. Sist.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. A. Bashkin, “Ob effektivnom modelirovanii neogranichennogo resursa pri pomoschi odnoschetchikovykh konturov”, Model. i analiz inform. sistem, 20:2 (2013), 139–156
|Number of views:|