English
Related papers

Related papers: Behavioural equivalences for timed systems

200 papers

This paper introduces a new behavioral system model with distinct external and internal signals possibly evolving on different time scales. This allows to capture abstraction processes or signal aggregation in the context of control and…

Systems and Control · Computer Science 2014-02-17 Anne-Kathrin Schmuck , Jörg Raisch

Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work…

Logic in Computer Science · Computer Science 2025-01-28 Jonas Forster , Lutz Schröder , Paul Wild

There has been a long history of using fuzzy language equivalence to compare the behavior of fuzzy systems, but the comparison at this level is too coarse. Recently, a finer behavioral measure, bisimulation, has been introduced to fuzzy…

Artificial Intelligence · Computer Science 2016-11-15 Yongzhi Cao , Guoqing Chen , Etienne Kerre

Existing literature on timed opacity uses specific definitions for restricted subclasses of timed automata or limited observation models. This lack of a unified definition makes it difficult to establish formal relationships and compare the…

Formal Languages and Automata Theory · Computer Science 2026-03-30 Zhe Zhang , Martijn Goorden , Michel Reniers

We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is…

Logic in Computer Science · Computer Science 2021-09-29 Thorsten Wißmann , Stefan Milius , Lutz Schröder

Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…

Logic in Computer Science · Computer Science 2024-01-31 Linan Chen , Florence Clerc , Prakash Panangaden

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While…

Cryptography and Security · Computer Science 2022-06-08 Johan Arcile , Étienne André

Extending well-structured transition systems to incorporate a probabilistic scheduling rule, we define a new class of stochastic well-structured transition systems that includes population protocols, chemical reaction networks, and many…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-12-25 James Aspnes

Time perception - how humans and animals perceive the passage of time - forms the basis for important cognitive skills such as decision-making, planning, and communication. In this work, we propose a framework for examining the mechanisms…

Systems and Control · Electrical Eng. & Systems 2023-11-08 Inês Lourenço , Robert Mattila , Rodrigo Ventura , Bo Wahlberg

Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is…

Logic in Computer Science · Computer Science 2010-06-29 Alessandro Aldini

The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…

Logic in Computer Science · Computer Science 2014-10-17 Alexander Kurz , Stefan Milius , Dirk Pattinson , Lutz Schröder

Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude…

Logic in Computer Science · Computer Science 2012-10-10 Martin Lange , Etienne Lozes , Manuel Vargas Guzmán

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…

Logic in Computer Science · Computer Science 2023-01-25 Rob van Glabbeek

I show how transition systems can be applied to the naturally concurrent behaviour of excitable media. I consider structured excitable media, in which excitations are constrained to propagate only in defined narrow channels, and cannot…

Pattern Formation and Solitons · Physics 2012-11-27 William M. Stevens

Bisimulation is a concept that captures behavioural equivalence of states in a variety of types of transition systems. It has been widely studied in a discrete-time setting where the notion of a step is fundamental. In our setting we are…

Logic in Computer Science · Computer Science 2024-05-01 Linan Chen , Florence Clerc , Prakash Panangaden

While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such…

Logic in Computer Science · Computer Science 2011-05-09 Adrien Piérard , Eijiro Sumii

Animals exploit time to survive in the world. Temporal information is required for higher-level cognitive abilities such as planning, decision making, communication, and effective cooperation. Since time is an inseparable part of cognition,…

Artificial Intelligence · Computer Science 2020-12-29 Hamit Basgol , Inci Ayhan , Emre Ugur

Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…

Logic in Computer Science · Computer Science 2024-03-29 Alexandru Baltag , Johan van Benthem , Dazhu Li

We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is…

Logic in Computer Science · Computer Science 2023-11-20 Thorsten Wißmann , Stefan Milius , Lutz Schröder

The increasing relevance of areas such as real-time and embedded systems, pervasive computing, hybrid systems control, and biological and social systems modeling is bringing a growing attention to the temporal aspects of computing, not only…

General Literature · Computer Science 2013-08-15 Carlo A. Furia , Dino Mandrioli , Angelo Morzenti , Matteo Rossi
‹ Prev 1 2 3 10 Next ›