The Glory of the Past and Geometrical Concurrency
Cristian Prisacariu

TL;DR
This paper explores modal logics for higher dimensional automata (HDAs), demonstrating how extending these logics with past modalities can capture hereditary history preserving bisimulation, thus enhancing the understanding of geometric concurrency models.
Contribution
It introduces a standard modal logic with past modalities for HDAs, extending previous logics, and relates this to ST-configuration structures to better understand hereditary history preserving bisimulation.
Findings
Past modalities enable capturing hereditary history preserving bisimulation.
The new logic extends HDML with standard past modalities.
Relation between HDAs and ST-configuration structures clarifies concurrency semantics.
Abstract
This paper contributes to the general understanding of the geometrical model of concurrency that was named higher dimensional automata (HDAs) by Pratt. In particular we investigate modal logics for such models and their expressive power in terms of the bisimulation that can be captured. The geometric model of concurrency is interesting from two main reasons: its generality and expressiveness, and the natural way in which autoconcurrency and action refinement are captured. Logics for this model, though, are not well investigated, where a simple, yet adequate, modal logic over HDAs was only recently introduced. As this modal logic, with two existential modalities, during and after, captures only split bisimulation, which is rather low in the spectrum of van Glabbeek and Vaandrager, the immediate question was what small extension of this logic could capture the more fine-grained hereditary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · semigroups and automata theory
