ACM SIGOPS Operating Systems Review
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
CSP-CASL: a new integration of process algebra and algebraic specification
Theoretical Computer Science - Algebraic methods in language processing
Failure-free coordinators synthesis for component-based architectures
Science of Computer Programming
Ready to preorder: The case of weak process semantics
Information Processing Letters
A Logical Reasoning Approach to Automatic Composition of Stateless Components
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
Abstract reasoning for planning and coordination
Journal of Artificial Intelligence Research
Theoretical Computer Science
Process algebra: a unifying approach
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
A Logical Reasoning Approach to Automatic Composition of Stateless Components
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
| Hi-index | 0.00 |