A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
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
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Theoretical Computer Science
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
Process algebra
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
Teams can see pomsets (preliminary version)
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Dynamic Logic
Handbook of Process Algebra
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
ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Homology of Higher Dimensional Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
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
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
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
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Higher dimensional automata revisited
Mathematical Structures in Computer Science
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
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
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
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
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
We review the conceptual development of (true) concurrency and branching time starting from Petri nets and proceeding via Mazurkiewicz traces, pomsets, bisimulation, and event structures up to higher dimensional automata (HDAs), whose acyclic case may be identified with triadic event structures and triadic Chu spaces. Acyclic HDAs may be understood as extending the two truth values of Boolean logic with a third value $\T$ expressing transition. We prove the necessity of such a third value under mild assumptions about the nature of observable events, and show that the expansion of any complete Boolean basis $L$ to $L_{\T}$ with a third literal $\that a$ expressing $a=\T$ forms an expressively complete basis for the representation of acyclic HDAs. The main contribution is a new value $\cancel$ of cancellation, which is a sibling of $\T$, serving to distinguish $a(b+c)$ from $ab+ac$ while simplifying the extensional definitions of termination $\tick\A$ and sequence $\A\B$. We show that every HDAX (acyclic HDA with $\cancel$) is representable in the expansion of $L_{\T}$ to $L_{\T\cancel}$ with a fourth literal $\can a$ expressing $a=\cancel$.