Unique decomposition of processes
Theoretical Computer Science
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
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
How to Parallelize Sequential Processes
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Normed BPA vs. Normed BPP Revisited
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Partially-Commutative Context-Free Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Unique parallel decomposition in branching and weak bisimulation semantics
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is "elementary," having doubly exponential non-deterministic time complexity.