Decidability of Bisimilarity for One-Counter Processes
Author:
- Petr JančarPJPetr Jančar
- 1 April 2000
- journal article
- Published by Elsevier in Information and Computation
- Vol. 158 (1) , 1-17
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Undecidability of bisimilarity for Petri nets and some related problemsTheoretical Computer Science, 1995
- Bisimulation Equivalence Is Decidable for All Context-Free ProcessesInformation and Computation, 1995
- A 222pn upper bound on the complexity of Presburger ArithmeticJournal of Computer and System Sciences, 1978
- Deterministic one-counter automataJournal of Computer and System Sciences, 1975
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966