Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Decidable first-order transition logics for PA-processes
Information and Computation
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)
Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Decidable first-order transition logics for PA-processes
Information and Computation
Verifying compensating transactions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 5.23 |