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
Splitting bisimulations and retrospective conditions
Information and Computation
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
A semantics for Behavior Trees using CSP with specification commands
Science of Computer Programming
Strong splitting bisimulation equivalence
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Repairing time-determinism in the process algebra for hybrid systems ACPhssrt
Theoretical Computer Science
Reliable supervisory coordination of stochastic communicating processes with data
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |