The theory of database concurrency control
The theory of database concurrency control
Theoretical Computer Science
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Communications of the ACM
The Duality of TIme and Information
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Modeling concurrency by partial orders and nonlinear transition systems
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Chu spaces as a semantic bridge between linear logic and mathematics
Theoretical Computer Science - Linear logic
Chu Spaces : A Model for Concurrency
Chu Spaces : A Model for Concurrency
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Higher dimensional automata revisited
Mathematical Structures in Computer Science
Gates accept concurrent behavior
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
| Hi-index | 0.00 |
Enriched categories have been applied in the past to both event-oriented true concurrency models and state-oriented information systems, with no evident relationship between the two. Ordinary Chu spaces expose a natural duality between partially ordered temporal spaces (pomsets, event structures), and partially ordered information systems. Barr and Chu's original definition of Chu spaces however was for the general V -enriched case, with ordinary Chu spaces arising for V = Set (equivalently V = Pos at least for biextensional Chu spaces). We extend time-information duality to the general enriched case, and apply it to put on a common footing event structures, higher-dimensional automata (HDAs), a cancellation-based approach to branching time, and other models treatable by enriching either event (temporal) space or state (information) space.