BPA bisimilarity is EXPTIME-hard

Given a basic process algebra (BPA) and two stack symbols, the BPA bisimilarity problem asks whether the two stack symbols are bisimilar. We show that this problem is EXPTIME-hard.

[1]  Jitka StříAbrná.  Hardness results for weak bisimilarity of simple process algebras , 1998 .

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[4]  Richard Mayr.  On the Complexity of Bisimulation Problems for Pushdown Automata , 2000, IFIP TCS.

[5]  Slawomir Lasota,et al.  Fast equivalence-checking for normed context-free processes , 2010, FSTTCS.

[6]  Géraud Sénizergues,et al.  The Bisimulation Problem for Equational Graphs of Finite Out-Degree , 2000, SIAM J. Comput..

[7]  Richard Mayr,et al.  Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard , 2004, EXPRESS.

[8]  Faron Moller,et al.  A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, Theor. Comput. Sci..

[9]  Colin Stirling.  Decidability of higher-order matching , 2009, Log. Methods Comput. Sci..

[10]  Jirí Srba,et al.  Roadmap of Infinite Results , 2002, Bull. EATCS.

[11]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .

[12]  Antonín Kucera,et al.  Equivalence-checking on infinite-state systems: Techniques and results , 2002, Theory and Practice of Logic Programming.

[13]  James Worrell,et al.  On the Complexity of Computing Probabilistic Bisimilarity , 2012, FoSSaCS.

[14]  Petr Jancar,et al.  Strong bisimilarity on basic parallel processes in PSPACE-complete , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[15]  Marcin Jurdzinski,et al.  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2007, Log. Methods Comput. Sci..

[16]  Petr Jancar,et al.  Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof) , 2012, Log. Methods Comput. Sci..

[17]  Antonín Kucera,et al.  On the complexity of checking semantic equivalences between pushdown processes and finite-state processes , 2010, Inf. Comput..

[18]  Jirí Srba.  Strong bisimilarity of simple process algebras: complexity lower bounds , 2003, Acta Informatica.

[19]  Stanislav Böhm,et al.  Bisimilarity of One-Counter Processes Is PSPACE-Complete , 2010, CONCUR.

[20]  Jirí Srba,et al.  Undecidability of bisimilarity by defender's forcing , 2008, JACM.

[21]  Jirí Srba.  Beyond Language Equivalence on Visibly Pushdown Automata , 2009, Log. Methods Comput. Sci..

[22]  Jitka Stríbrná.  Hardness results for weak bisimilarity of simple process algebras , 1998, Electron. Notes Theor. Comput. Sci..

[23]  Bernhard Steffen,et al.  An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.