The regular viewpoint on PA-processes
Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Efficient Verification Algorithms for One-Counter Processes
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
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
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 Simulation-Checking with Sequential Systems
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
| Hi-index | 0.00 |