English
Related papers

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

200 papers

Multilevel modeling is increasingly relevant in the context of modelling and simulation since it leads to several potential benefits, such as software reuse and integration, the split of semantically separated levels into sub-models, the…

Performance · Computer Science 2024-03-26 Luca Serena , Moreno Marzolla , Gabriele D'Angelo , Stefano Ferretti

In the manufacturing context, there have been numerous efforts to use modeling and simulation tools and techniques to improve manufacturing efficiency over the last four decades. While an increasing number of manufacturing system decisions…

Other Computer Science · Computer Science 2007-05-23 Hind El Haouzi

State estimation of multi-modal hybrid systems is an important problem with many applications in the field robotics. However, incorporating discrete modes in the estimation process is hampered by a potentially combinatorial growth in…

Robotics · Computer Science 2021-03-25 Fan Jiang , Varun Agrawal , Russell Buchanan , Maurice Fallon , Frank Dellaert

Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Anaël Grandjean , Gaétan Richard , Véronique Terrier

In standard process algebra, parallel components do not share a common state and communicate through synchronisation. The advantage of this type of communication is that it facilitates compositional reasoning. For modelling and analysing…

Logic in Computer Science · Computer Science 2020-09-01 Mark Bouwman , Bas Luttik , Wouter Schols , Tim A. C. Willemse

We try to clarify the relationship between computation and concurrency. Base on the so-called pomsetc automata and step automata, we introduce communication and more operators, and establish the algebras modulo language equivalence and…

Logic in Computer Science · Computer Science 2026-04-20 Yong Wang

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral…

Formal Languages and Automata Theory · Computer Science 2017-05-16 Borja Balle , Pascale Gourdeau , Prakash Panangaden

Statistical inference is the science of drawing conclusions about some system from data. In modern signal processing and machine learning, inference is done in very high dimension: very many unknown characteristics about the system have to…

Disordered Systems and Neural Networks · Physics 2020-10-29 Jean Barbier

Time-delay systems are an important class of dynamical systems which provide a solid mathematical framework to deal with many application domains of interest ranging from biology, chemical, electrical, and mechanical engineering, to…

Dynamical Systems · Mathematics 2009-03-28 Giordano Pola , Pierdomenico Pepe , Maria D. Di Benedetto , Paulo Tabuada

We consider systems of rational agents who act and interact in pursuit of their individual and collective objectives. We study and formalise the reasoning of an agent, or of an external observer, about the expected choices of action of the…

Computer Science and Game Theory · Computer Science 2021-02-12 Valentin Goranko , Fengkui Ju

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

One of the fundamental tasks of autonomous driving is safe trajectory planning, the task of deciding where the vehicle needs to drive, while avoiding obstacles, obeying safety rules, and respecting the fundamental limits of road. Real-world…

Robotics · Computer Science 2025-03-26 Milin Patel , Marzana Khatun , Rolf Jung , Michael Glaß

In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal…

Logic in Computer Science · Computer Science 2013-06-13 Tingting Han , Christian Krause , Marta Kwiatkowska , Holger Giese

We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define…

Logic in Computer Science · Computer Science 2015-03-17 Pedro D'Argenio , Pedro Sánchez Terraf , Nicolás Wolovick

Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…

Formal Languages and Automata Theory · Computer Science 2025-08-12 Deepalakshmi D , Lisa Mathew

For multi-vehicle complex traffic scenarios in shared spaces such as intelligent intersections, safe coordination and trajectory planning is challenging due to computational complexity. To meet this challenge, we introduce a computationally…

Systems and Control · Electrical Eng. & Systems 2025-12-15 Amirreza Akbari , Johan Thunberg

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

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation…

Formal Languages and Automata Theory · Computer Science 2010-09-27 Marianne Delorme , Jacques Mazoyer , Nicolas Ollinger , Guillaume Theyssier

Several notions of bisimulation relations for probabilistic non-deterministic transition systems have been considered in the literature. We consider a novel testing-based behavioral equivalence called upper-expectation bisimilarity and…

Logic in Computer Science · Computer Science 2013-10-03 Matteo Mio
‹ Prev 1 3 4 5 6 7 10 Next ›