Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Planning Proofs of Equations in CCS
Automated Software Engineering
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science - Expressiveness in concurrency
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Prime normal form and equivalence of simple grammars
Theoretical Computer Science - Implementation and application of automata
Equivalence of simple functions
Theoretical Computer Science
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Composition of Motion Description Languages
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
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
Deciding Bisimilarity of Full BPA Processes Locally
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Partially-Commutative Context-Free Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
On the computational complexity of bisimulation, redux
Information and Computation
Expansive-bisimulation for context-free processes
Formal methods and hybrid real-time systems
Information and Computation
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Probabilistic generalization of simple grammars and its application to reinforcement learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Space-efficient scheduling of stochastically generated tasks
Information and Computation
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Reducing simple grammars: exponential against highly-polynomial time in practice
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Equivalence of functions represented by simple context-free grammars with output
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
Fundamenta Informaticae
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
BPA bisimilarity is EXPTIME-hard
Information Processing Letters
Isomorphism of regular trees and words
Information and Computation
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
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
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 5.23 |