English
Related papers

Related papers: The Glory of the Past and Geometrical Concurrency

200 papers

Higher-dimensional automata (HDAs) are models of non-interleaving concurrency for analyzing concurrent systems. There is a rich literature that deals with bisimulations for concurrent systems, and some of them have been extended to HDAs.…

Logic in Computer Science · Computer Science 2026-03-03 Safa Zouari , Krzysztof Ziemiański , Uli Fahrenberg

Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures,…

Logic in Computer Science · Computer Science 2014-05-19 Cristian Prisacariu

We give a formalization of Pratt's intuitive sculpting process for higher-dimensional automata (HDA). Intuitively, an HDA is a sculpture if it can be embedded in (i.e., sculpted from) a single higher dimensional cell (hypercube). A first…

Logic in Computer Science · Computer Science 2023-06-22 Uli Fahrenberg , Christian Johansen , Christopher A. Trotter , Krzysztof Ziemiański

Higher dimensional automata (HDAs) provide a geometric model of true concurrency, yet their standard formulation encodes an artificial total order on events. This representational artifact causes a fundamental mismatch between the…

Formal Languages and Automata Theory · Computer Science 2026-05-06 Safa Zouari

Reversible computation opens up the possibility of overcoming some of the hardware's current physical limitations. It also offers theoretical insights, as it enriches multiple paradigms and models of computation, and sometimes…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-15 Clément Aubert , Ioana Cristescu

The problem of identifying geometric structure in data is a cornerstone of (unsupervised) learning. As a result, Geometric Representation Learning has been widely applied across scientific and engineering domains. In this work, we…

Machine Learning · Computer Science 2025-06-03 Imran Nasim , Melanie Weber

We present a new language semantics for real-time concurrency. Its operational models are higher-dimensional timed automata (HDTAs), a generalization of both higher-dimensional automata and timed automata. In real-time concurrent systems,…

Formal Languages and Automata Theory · Computer Science 2025-02-06 Amazigh Amrane , Hugo Bazille , Emily Clement , Uli Fahrenberg , Philipp Schlehuber-Caissier

We introduce event identifier logic (EIL) which extends Hennessy-Milner logic by the addition of (1) reverse as well as forward modalities, and (2) identifiers to keep track of events. We show that this logic corresponds to hereditary…

Logic in Computer Science · Computer Science 2011-08-24 Iain Phillips , Irek Ulidowski

The present paper defines ST-structures (and an extension of these, called STC-structures). The main purpose is to provide concrete relationships between highly expressive concurrency models coming from two different schools of thought: the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-24 Cristian Prisacariu

The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities, and corresponding residual implications. In this work, we…

Logic in Computer Science · Computer Science 2023-08-10 Tikhon Pshenitsyn

We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be…

Logic in Computer Science · Computer Science 2015-03-19 Paolo Baldan , Silvia Crafa

We introduce languages of higher-dimensional automata (HDAs) and develop some of their properties. To this end, we define a new category of precubical sets, uniquely naturally isomorphic to the standard one, and introduce a notion of event…

Formal Languages and Automata Theory · Computer Science 2021-09-06 Uli Fahrenberg , Christian Johansen , Georg Struth , Krzysztof Ziemiański

High-index saddle dynamics (HiSD) serves as a competitive instrument in searching the any-index saddle points and constructing the solution landscape of complex systems. The Lagrangian multiplier terms in HiSD ensure the Stiefel manifold…

Numerical Analysis · Mathematics 2024-02-20 Lei Zhang , Pingwen Zhang , Xiangcheng Zheng

The relationships between various equivalences on configuration structures, including interleaving bisimulation (IB), step bisimulation (SB) and hereditary history-preserving (HH) bisimulation, have been investigated by van Glabbeek and…

Logic in Computer Science · Computer Science 2010-02-16 Iain Phillips , Irek Ulidowski

In the search for knowledge graph embeddings that could capture ontological knowledge, geometric models of existential rules have been recently introduced. It has been shown that convex geometric regions capture the so-called quasi-chained…

Logic in Computer Science · Computer Science 2021-08-30 Camille Bourgaux , Ana Ozaki , Jeff Z. Pan

Hidden Markov models (HMMs) and partially observable Markov decision processes (POMDPs) form a useful tool for modeling dynamical systems. They are particularly useful for representing environments such as road networks and office…

Artificial Intelligence · Computer Science 2013-01-30 Hagit Shatkay

Higher-dimensional automata constitute a very expressive model for concurrent systems. In this paper, we discuss "topological abstraction" of higher-dimensional automata, i.e., the replacement of HDAs by smaller ones that can be considered…

Formal Languages and Automata Theory · Computer Science 2015-06-09 Thomas Kahl

Classical geometric mechanics, including the study of symmetries, Lagrangian and Hamiltonian mechanics, and the Hamilton-Jacobi theory, are founded on geometric structures such as jets, symplectic and contact ones. In this paper, we shall…

Mathematical Physics · Physics 2023-06-09 Qiao Huang , Jean-Claude Zambrini

Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations…

Formal Languages and Automata Theory · Computer Science 2019-11-04 Gerco van Heerdt , Matteo Sammartino , Alexandra Silva

The paper presents a novel modular hybrid parallel robot for pancreatic surgery and its higher-order kinematics derived based on various formalisms. The classical vector, homogeneous transformation matrices and dual quaternion approaches…

Robotics · Computer Science 2025-03-31 Calin Vaida , Iosif Birlescu , Bogdan Gherman , Daniel Condurache , Damien Chablat , Doina Pisla
‹ Prev 1 2 3 10 Next ›