Category theory and models for parallel computation
Proceedings of a tutorial and workshop on Category theory and computer programming
Combinatorics on traces
Handbook of logic in computer science (vol. 4)
The Book of Traces
General Morphisms of Petri Nets (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decompositions of Asynchronous Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Generalized Automata and Their Net Representations
Unifying Petri Nets, Advances in Petri Nets
On Concurrent Realization of Reactive Systems and Their Morphisms
Unifying Petri Nets, Advances in Petri Nets
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
Dualities Between Nets and Automata Induced by Schizophrenic Objects
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
Modular system development with pullbacks
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Finite Completeness of Categories of Petri Nets
Fundamenta Informaticae
A Multi-facet Approach to Dynamic Agent Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
It has been observed that various synchronisation operators underlying the modular design of concurrent systems can be explained as pullbacks in suitable categories of concurrent systems. Here, the boundaries of such approach are investigated. For this purpose we study the issue of completeness in categories of trace monoids. It turns out that (finite) completeness is achieved if trace monoids with concurrency preserving homomorphisms are considered. Taking arbitrary monoid homomorphisms leads, in general, to incompleteness. The results obtained are used to reveal an area in which the code problem for trace monoids, undecidable in general, has always a positive answer.