Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Journal of the ACM (JACM) - The MIT Press scientific computation series
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Decidability of bisimulation equivalence for normed pushdown processes
Theoretical Computer Science
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Communication and Concurrency
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Bisimulation and language equivalence
Logic for concurrency and synchronisation
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Hi-index | 0.00 |
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by Sénizergues (1998, 2005) who showed the decidability for regular (or equational) graphs of finite out-degree (which include unnormed pushdown processes). The question of decidability of bisimilarity for a more general class of so called Type -1 systems (generated by prefix rewrite rules of the form $R \ensuremath{\stackrel{a}{\longrightarrow}} w$ where R is a regular language) was left open; this was repeatedly indicated by both Stirling and Sénizergues. Here we answer the question negatively, i.e., we show undecidability of bisimilarity on Type -1 systems, even in the normed case. We complete the picture by considering classes of systems that use rewrite rules of the form $w \ensuremath{\stackrel{a}{\longrightarrow}} R$ and $R_1 \ensuremath{\stackrel{a}{\longrightarrow}} R_2$ and show when they yield low undecidability (Π$^{\rm 0}_{\rm 1}$-completeness) and when high undecidability (Σ$^{\rm 1}_{\rm 1}$-completeness), all with and without the assumption of normedness.