Simulation preorder over simple process algebras
Information and Computation
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)
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
HMSCs as Partial Specifications ... with PNs as Completions
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Simulation and Bisimulation over One-Counter Processes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th 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
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A Logical Viewpoint on Process-Algebraic Quotients
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On Simulation-Checking with Sequential Systems
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
HMSCs as partial specifications ... with PNs as completions
Modeling and verification of parallel processes
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
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
Information Processing Letters
Region based synthesis of P/T-nets and its potential applications
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |