Towards a general theory of action and time
Artificial Intelligence
The theory of database concurrency control
The theory of database concurrency control
Modeling concurrency with partial orders
International Journal of Parallel Programming
The equational theory of pomsets
Theoretical Computer Science
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Questions and answers: a category arising in linear logic complexity theory, and set theory
Proceedings of the workshop on Advances in linear logic
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
CHU spaces: a model of concurrency
CHU spaces: a model of concurrency
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Durations for Truly-Concurrent Transitions
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Time, Tense and Relativity Revisited
IPMU '90 Proceedings of the 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems: Uncertainty in Knowledge Bases
An Analysis of the Temporal Relations of Intervals in Relativistic Space-Time
IPMU '92 Proceedings of the 4th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems: Advanced Methods in Artificial Intelligence
Traces, Histories, Graphs: Instances of a Process Monoid
Proceedings of the Mathematical Foundations of Computer Science 1984
The Second Calculus of Binary Relations
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Event Spaces and their Linear Logic
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
A New Definition of Morphism on Petri Nets
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial
Seminar on Concurrency, Carnegie-Mellon University
Homology of Higher Dimensional Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Domains of Higher-Dimensional Automata
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Semantics and Analysis of Linda-Based Languages
WSA '93 Proceedings of the Third International Workshop on Static Analysis
Some Constructions for Order-Theoretic Models of Concurrency
Proceedings of the Conference on Logic of Programs
Extraction of Concurrent Processes from Higher Dimensional Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
A Dialectica-like Model of Linear Logic
Category Theory and Computer Science
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The Stone Gamut: A Coordinatization of Mathematics
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Full Completeness of the Multiplicative Linear Logic of Chu Spaces
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Partial orders and the axiomatic theory of shuffle (pomsets)
Partial orders and the axiomatic theory of shuffle (pomsets)
Constraint propagation + relativistic time = more reliable concurrent programs
IEA/AIE'93 Proceedings of the 6th international conference on Industrial and engineering applications of artificial intelligence and expert systems
Event-State Duality: The Enriched Case
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Software Geography: Physical and Economic Aspects
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Sheaves and Geometric Logic and Applications to Modular Verification of Complex Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Modal logic over higher dimensional automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Simultaneity in event structures
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Streams, d-Spaces and Their Fundamental Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be formalized via such discrete geometries as n-categories, simplicial complexes, cubical complexes and Chu spaces. We advocate the last as having a clear notion of event, a well-defined process algebra uniformly extending that for event structures, and ease of extension beyond the basic before-during-after analysis.