Bisimulation equivalence is decidable for one-counter processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 549-559

  Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BISIMULATION EQUIVALENCES; FINITE STATE PROCESS; PUSH-DOWN AUTOMATA; PUSHDOWN;

COMPUTABILITY AND DECIDABILITY;

EID: 84951147170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_210     Document Type: Conference Paper

References (12)

1. 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
2. Christensen S., Hirshfeld Y. and Molier 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
3. Christensen S., Hiittel H. and Stirling C: Bisimulation equivalence is decidable for all context-free processes; Information and Computation 121 (1995) 143-148
4. 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
5. Ginsburg S. and Spanier E.: Semigroups, Presburger formulas, and languages; Pacific J. of Mathematics 16 (1966) 285-296
6. 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
7. Jancar 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 Jancar P.: Undecidability of Bisimilarity for Petri Nets and Related Problems; Theoretical Computer Science 148 (1995) 281-301)
8. 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
9. Janćar P., Molier 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
10. Milner R.: Communication and Concurrency (Prentice Hall, 1989)
11. Oppen D.C: A 2 upper bound on the complexity of Presburger Arithmetic, J. of Comp. and System Sci. 16 (1978) 323-332
12. 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