Model checking of systems with many identical timed processes
Theoretical Computer Science
On the Existence of Network Invariants for Verifying Parameterized Systems
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
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
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Decidability of Weak Bisimilarity for a Subset of BPA
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Deciding weak bisimilarity of normed context-free processes using tableau
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
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
Hi-index | 0.00 |