From rewrite rules to bisimulation congruences
Theoretical Computer Science
A Linear Metalanguage for Concurrency
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Event Structures as Presheaves -Two Representation Theorems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Theoretical Computer Science - Category theory and computer science
Hi-index | 0.00 |