Communication and Concurrency
A Categorical Axiomatics for Bisimulation
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Presheaf Semantics of Value-Passing Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Theory of Recursive Domains with Applications to Concurrency
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Event Structures as Presheaves -Two Representation Theorems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
| Hi-index | 0.01 |
A metalanguage for concurrent process languages is introduced. Within it a range of process languages can be defined, including higher-order process languages where processes are passed and received as arguments. The metalanguage is provided with two interpretations both of which can be understood as categorical models of a variant of linear logic. One interpretation is in a simple category of nondeterministic domains; here a process will denote its set of traces. The other interpretation, obtained by direct analogy with the nondeterministic domains, is in a category of presheaf categories; the nondeterministic branching behaviour of a process is captured in its denotation as a presheaf. Every presheaf category possesses a notion of (open-map) bisimulation, preserved by terms of the metalanguage. The conclusion summarises open problems and lines of future work.