Approximating Bisimulation in One-counter Nets
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-co...
Saved in:
| Main Author: | V. A. Bashkin |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2011-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1096 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Efficient Representation of an Unbounded Resource with the Aid of One-Counter Circuits
by: V. A. Bashkin
Published: (2013-04-01) -
Polyprograms and Polyprogram Bisimulation
by: Sergei Grechanik
Published: (2018-10-01) -
On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions
by: Vladimir A. Bashkin
Published: (2020-06-01) -
KESTABILAN MODEL PETRI NET DARI SISTEM PEMBAYARAN TAGIHAN LISTRIK PT. PLN (Persero) RAYON AMBON TIMUR
by: Zumrotus Sya'diyah
Published: (2021-12-01) -
On the Hereditary Properties of Modular Nets
by: V. A. Bashkin
Published: (2015-03-01)