Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |