Termination, deadlock, and divergence
Journal of the ACM (JACM)
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Register-machine based processes
Journal of the ACM (JACM)
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Splitting bisimulations and retrospective conditions
Information and Computation
A characterization of regular expressions under bisimulation
Journal of the ACM (JACM)
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
Parallel Processes with Implicit Computational Capital
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrency, Graphs and Models
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Fundamenta Informaticae - Application of Concurrency to System Design
Formal Verification of Timed Systems Using Cones and Foci
Electronic Notes in Theoretical Computer Science (ENTCS)
Turing machines, transition systems, and interaction
Information and Computation
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
An Algebra of Behavioural Types
Information and Computation
Liveness, fairness and impossible futures
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A characterisation of weak bisimulation congruence
Processes, Terms and Cycles
Model theory for process algebra
Processes, Terms and Cycles
Fundamenta Informaticae - Application of Concurrency to System Design
Information and Computation
| Hi-index | 5.23 |