On oraclizable networks and Kahn's principle
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Erratic fudgets: a semantic theory for an embedded coordination language
Science of Computer Programming - Special issue on coordination languages and architectures
Towards a Characterisation of Finite-State Message-Passing Systems
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
On Recognizable Languages in Divisibility Monoids
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
A relational model of non-deterministic dataflow
Mathematical Structures in Computer Science
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Normal Form Simulation for McCarthy's Amb
Electronic Notes in Theoretical Computer Science (ENTCS)
Turing machines, transition systems, and interaction
Information and Computation
Fairness, Resources, and Separation
Electronic Notes in Theoretical Computer Science (ENTCS)
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
| Hi-index | 0.00 |