The complexity of bisimilarity-checking
✍
Antonı́n Kučera
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 376 KB
We study the problem of bisimilarity-checking between processes of one-counter automata and ÿnite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets (which are 'restricted' one-counter automata where the counter cannot be tested for zero) and ÿnite-state p