Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Basic process algebra with deadlocking states
Theoretical Computer Science
Composition, decomposition and model checking of pushdown processes
Nordic Journal of Computing
Approximating Weak Bisimulation on Basic Process Algebras
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th 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
Decidability of Weak Bisimilarity for a Subset of BPA
Electronic Notes in Theoretical Computer Science (ENTCS)
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Deciding Bisimilarity of Full BPA Processes Locally
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Expansive-bisimulation for context-free processes
Formal methods and hybrid real-time systems
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the Decidability of Non-Interleaving Process Equivalences
Fundamenta Informaticae
Checking equality and regularity for normed BPA with silent moves
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.01 |