On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Decomposition and complexity of hereditary history preserving bisimulation on BPP
CONCUR 2005 - Concurrency Theory
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |