Handbook of logic in computer science (vol. 4)
Presheaves as transition systems
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Communication and Concurrency
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Minimisation and minimal realisation in Span(Graph)
Mathematical Structures in Computer Science
Tree-functors, determinacy and bisimulations
Mathematical Structures in Computer Science
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Hi-index | 0.00 |
We consider processes consisting of a category of states varying over a control category as prescribed by a unique factorisation lifting functor. After a brief analysis of the structure of general processes in this setting, we restrict attention to linearly-controlled ones. To this end, we introduce and study a notion of path-linearisable category in which any two paths of morphisms with equal composites can be linearised (or interleaved) in a canonical fashion. Our main result is that categories of linearly-controlled processes (viz., processes controlled by path-linearisable categories) are sheaf models.