English
Related papers

Related papers: Bisimulations and Logics for Higher-Dimensional Au…

200 papers

In this paper we study the equivalence of nondeterministic automata pairing the concept of a bisimulation with the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which…

Formal Languages and Automata Theory · Computer Science 2011-03-01 Miroslav Ćirić , Jelena Ignjatović , Milan Bašić , Ivana Jančić

There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models and fuzzy interpretations in description logics. Fuzzy bisimulations between…

Logic in Computer Science · Computer Science 2021-06-16 Linh Anh Nguyen

For the model of probabilistic labelled transition systems that allow for the co-existence of nondeterminism and probabilities, we present two notions of bisimulation metrics: one is state-based and the other is distribution-based. We…

Logic in Computer Science · Computer Science 2015-09-14 Yuxin Deng , Wenjie Du , Daniel Gebler

The problem of finding a finite state symbolic model which is bisimilar to a hybrid dynamical system (HDS) and has the minimum number of states is considered. The considered class of HDS allows for discrete-valued inputs that only affect…

Systems and Control · Computer Science 2014-09-02 Babak Tavassoli

Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…

Formal Languages and Automata Theory · Computer Science 2018-12-21 Fabian Reiter

Higher-dimensional automata (HDA) are a model of concurrency that models simultaneous execution of events using higher dimensional cells. HDA recognize languages of pomsets, a generalization of finite words whose letters are partially…

Formal Languages and Automata Theory · Computer Science 2026-05-26 Enzo Erlich , Jérémy Ledent , Krzysztof Ziemiański

We study comparisons between interpretations in description logics with respect to "logical consequences" of the form of semi-positive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions…

Logic in Computer Science · Computer Science 2013-04-23 Ali Rezaei Divroodi , Linh Anh Nguyen

Hybrid Communicating Sequential Processes (HCSP) is a powerful formal modeling language for hybrid systems, which is an extension of CSP by introducing differential equations for modeling continuous evolution and interrupts for modeling…

Logic in Computer Science · Computer Science 2016-09-09 Gaogao Yan , Li Jiao , Yangjia Li , Shuling Wang , Naijun Zhan

Large computer-understandable proofs consist of millions of intermediate logical steps. The vast majority of such steps originate from manually selected and manually guided heuristics applied to intermediate goals. So far, machine learning…

Artificial Intelligence · Computer Science 2017-03-02 Cezary Kaliszyk , François Chollet , Christian Szegedy

A Markov decision process (MDP) is a state-based dynamical system capable of describing probabilistic behaviour with rewards. In this paper, we view MDPs as coalgebras living in the category of analytic spaces, a very general class of…

Logic in Computer Science · Computer Science 2025-05-30 Daniel Luckhardt , Harsh Beohar , Clemens Kupke

We construct labeling homomorphisms on the cubical homology of higher-dimensional automata and show that they are natural with respect to cubical dimaps and compatible with the tensor product of HDAs. We also indicate two possible…

Algebraic Topology · Mathematics 2018-02-15 Thomas Kahl

Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic…

Logic in Computer Science · Computer Science 2015-03-13 Lorenz Demey

In a recent paper, we have introduced two types of fuzzy simulations (forward and backward) and five types of fuzzy bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models for the fuzzy…

Logic · Mathematics 2025-02-17 Marko Stanković , Miroslav Ćirić , Jelena Ignjatović

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

Higher-dimensional automata, i.e., pointed labeled precubical sets, are a powerful combinatorial-topological model for concurrent systems. In this paper, we show that for every (nonempty) connected polyhedron there exists a shared-variable…

Formal Languages and Automata Theory · Computer Science 2024-04-26 Catarina Faustino , Thomas Kahl , Rodrigo Lopes

Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by \'Ciri\'c et al. (2012) as fuzzy relations between the sets of states of the automata. However, they act as a crisp relationship…

Formal Languages and Automata Theory · Computer Science 2022-05-05 Linh Anh Nguyen

Hierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high…

Logic in Computer Science · Computer Science 2016-06-08 Alexandre Madeira , Manuel A. Martins , Luís S. Barbosa

Hybrid dynamical systems, which include continuous flow and discrete mode switching, can model robotics tasks like legged robot locomotion. Model-based methods usually depend on predefined gaits, while model-free approaches lack explicit…

Robotics · Computer Science 2025-04-08 Hang Liu , Sangli Teng , Ben Liu , Wei Zhang , Maani Ghaffari

We study bisimulations for useful description logics. The simplest among the considered logics is $\mathcal{ALC}_{reg}$ (a variant of PDL). The others extend that logic with inverse roles, nominals, quantified number restrictions, the…

Logic in Computer Science · Computer Science 2015-02-20 Ali Rezaei Divroodi , Linh Anh Nguyen

To improve the cognitive autonomy of humanoid robots, this research proposes a multi-scenario reasoning architecture to solve the technical shortcomings of multi-modal understanding in this field. It draws on simulation based experimental…

Robotics · Computer Science 2025-07-11 Libo Wang