Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational semantics for Petri net components
Theoretical Computer Science
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Process Algebra: An Algebraic Theory of Concurrency
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and Congruence Applied to η-Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for non interference
ESOP'03 Proceedings of the 12th European conference on Programming
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On cool congruence formats for weak bisimulations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Information and Computation
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Hi-index | 0.01 |