Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Basic process algebra with deadlocking states
Theoretical Computer Science
The regular viewpoint on PA-processes
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
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Prototyping Concurrent Systems with Agents and Artifacts: Framework and Core Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding Bisimilarity of Full BPA Processes Locally
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Towards a Formal Foundation to Orchestration Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
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
simpA: An agent-oriented approach for programming concurrent applications on top of Java
Science of Computer Programming
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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.00 |