Proof-Checking Protocols Using Bisimulations
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Liveness and Fairness in Process-Algebraic Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Located actions in process algebra with timing
Fundamenta Informaticae
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Located Actions in Process Algebra with Timing
Fundamenta Informaticae
Formal modeling of evolving self-adaptive systems
Science of Computer Programming
A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION
Fundamenta Informaticae
| Hi-index | 0.01 |