Modeling concurrency with partial orders
International Journal of Parallel Programming
Handbook of logic in computer science (vol. 4)
A Linear Metalanguage for Concurrency
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
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
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
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The category of event structures is known to embed fully and faithfully in the category of presheaves over pomsets. Here a characterisation of the presheaves represented by event structures is presented. The proof goes via a characterisation of the presheaves represented by event structures when the morphisms on event structures are "strict" in that they preserve the partial order of causal dependency.