Abstract
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter, in fact. Also regularity, i.e. bisimulation equivalence with some finite-state process, is shown to be decidable for the mentioned processes.
Supported by the Grant Agency of the Czech Republic, Grant No. 201/97/0456, and also by the Univ. of Ostrava grant No. 031/97
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burkart O., Caucal D. and Steffen B.: Bisimulation collapse and the process taxonomy; in Proc. CONCUR'96, Lecture Notes in Computer Science, Vol. 1119 (Springer, 1996) 247–262
Christensen S., Hirshfeld Y. and Moller F.: Bisimulation equivalence is decidable for all Basic Parallel Processes, in Proc. CONCUR'93, Lecture Notes in Computer Science, Vol. 715 (Springer, 1993) 143–157
Christensen S., Hüttel H. and Stirling C.: Bisimulation equivalence is decidable for all context-free processes; Information and Computation 121 (1995) 143–148
Esparza J.: Petri nets, commutative context-free grammars, and Basic Parallel Processes; in Proc. Fundamentals of Computation Theory (FCT) 1995, Lecture Notes in Computer Science, Vol. 965 (Springer, 1995) 221–232
Ginsburg S. and Spanier E.: Semigroups, Presburger formulas, and languages; Pacific J. of Mathematics 16 (1966) 285–296
Hirshfeld Y.: Petri nets and the equivalence problem; in Proc. Computer Science Logic (CSL) '93, Lecture Notes in Computer Science, Vol. 832 (Springer, 1994) 165–174
Jančar P.: Decidability questions for bisimilarity of Petri nets and some related problems; Techn.rep. ECS-LFCS-93-261, Dept. of comp. sci., Univ. of Edinburgh, UK, April 1993 (cf. also Jančar P.: Undecidability of Bisimilarity for Petri Nets and Related Problems; Theoretical Computer Science 148 (1995) 281–301)
Jancar P., Esparza J.: Deciding finiteness of Petri nets up to bisimulation; in Proc. ICALP'96, Paderborn, Germany, July 1996, Lecture Notes in Computer Science, Vol. 1099 (Springer, 1996) 478–489
Jancar P., Moller F.: Checking regular properties of Petri nets; in Proc. CONCUR'95, Philadelphia, U.S.A., August 1995, Lecture Notes in Computer Science, Vol. 962 (Springer, 1995) 348–362
Mimer R.: Communication and Concurrency (Prentice Hall, 1989)
Oppen D.C.: A \(2^{2^{2^{pn} } }\)upper bound on the complexity of Presburger Arithmetic, J. of Comp. and System Sci. 16 (1978) 323–332
Stirling C.: Decidability of bisimulation equivalence for normed pushdown processes; in Proc. CONCUR'96, Lecture Notes in Computer Science, Vol. 1119 (Springer, 1996) 217–232
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jančar, P. (1997). Bisimulation equivalence is decidable for one-counter processes. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_210
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_210
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive