Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Model checking of systems with many identical timed processes
Theoretical 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
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
Handling Global Conditions in Parameterized System Verification
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
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
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Decidability of Weak Bisimilarity for a Subset of BPA
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding weak bisimilarity of normed context-free processes using tableau
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
More on weak bisimilarity of normed basic parallel processes
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The power of maximal parallelism in p systems
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
A Hierarchy of Languages with Catenation and Shuffle
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |