Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Precongruence Formats for Decorated Trace Preorders
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
Conjunction on processes: Full abstraction via ready-tree semantics
Theoretical Computer Science
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Conjunction on processes: full–abstraction via ready–tree semantics
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Probabilistic CSP: preserving the laws via restricted schedulers
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Discrete Time Process Algebra: Absolute Time, Relative Time And Parametric Time
Fundamenta Informaticae
Rational Processes And Linear Systems In Gsp
Fundamenta Informaticae
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |