Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Decidability of bisimulation equivalence for normed pushdown processes
Theoretical Computer Science
Communication and Concurrency
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Note on the Tableau Technique for Commutative Transition Systems
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Decidability of branching bisimulation on normed commutative context-free processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |