English
Related papers

Related papers: Behavioural equivalences for timed systems

200 papers

A formalism is developed for describing approximate classical behaviour in finite (but possibly large) quantum systems. This is done in terms of a structure common to classical and quantum mechanics, viz. a Poisson space with a transition…

Quantum Physics · Physics 2015-06-26 N. P. Landsman

We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations. In our model events generated by transitions…

Logic in Computer Science · Computer Science 2015-09-25 Parosh Abdulla , Giorgio Delzanno , Marco Montali

In this contribution, the transitivity property of commutative first-order linear time-varying systems is investigated with and without initial conditions. It is proven that transitivity property of first-order systems holds with and…

Systems and Control · Computer Science 2021-03-05 Mehmet Emir Koksal

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs.…

Logic in Computer Science · Computer Science 2007-05-23 F. S. de Boer , M. Gabbrielli , M. C. Meo

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

The increasing importance of such fields as embedded systems, pervasive computing, and hybrid systems control is increasing attention to the time-dependent aspects of system modeling. In this paper, we focus on modeling conceptual time.…

Software Engineering · Computer Science 2021-04-05 Sabah Al-Fedaghi

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

In artificial intelligence, multi agent systems constitute an interesting typology of society modeling, and have in this regard vast fields of application, which extend to the human sciences. Logic is often used to model such kind of…

Artificial Intelligence · Computer Science 2019-09-19 Valentina Pitoni , Stefania Costantini

In this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, including timed automata, event-clock automata with and without diagonal…

Formal Languages and Automata Theory · Computer Science 2024-03-19 S Akshay , Paul Gastin , R Govind , Aniruddha R Joshi , B Srivathsan

Time-reversal symmetry is a prevalent feature of microscopic physics, including operational quantum theory and classical general relativity. Previous works have studied indefinite causal structure using the language of operational quantum…

Quantum Physics · Physics 2024-06-27 Luke Mrini , Lucien Hardy

Shared upstream dynamical processes are frequently the source of common inputs in various physical and biological systems. However, due to finite signal transmission speeds and differences in the distance to the source, time shifts between…

Neurons and Cognition · Quantitative Biology 2017-03-10 Ehsan Bolhasani , Yousef Azizi , Alireza Valizadeh , Matjaz Perc

A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a finite number of given features. Depending on its feature expression, each individual transition…

Formal Languages and Automata Theory · Computer Science 2017-02-28 Uli Fahrenberg , Axel Legay

This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…

Category Theory · Mathematics 2025-09-09 Suddhasattwa Das , Tomoharu Suda

In order to develop systems capable of artificial evolution, we need to identify which systems can produce complex behavior. We present a novel classification method applicable to any class of deterministic discrete space and time dynamical…

Artificial Intelligence · Computer Science 2021-08-04 Barbora Hudcová , Tomáš Mikolov

To maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then anticipate or act correctly at the right time. How the animals perceive, maintain, and use time intervals…

Neurons and Cognition · Quantitative Biology 2020-07-08 Zedong Bi , Changsong Zhou

In the bounded confidence model the opinions of a set of agents evolve over discrete time steps. In each round an agent averages the opinion of all agents whose opinions are at most a certain threshold apart. Here we assume that the…

Physics and Society · Physics 2025-12-23 Sascha Kurz

There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e.,…

Formal Languages and Automata Theory · Computer Science 2014-08-27 Davide Bresolin , Khaled El-Fakih , Tiziano Villa , Nina Yevtushenko

In complex systems, external parameters often determine the phase in which the system operates, i.e., its macroscopic behavior. For nearly a century, statistical physics has extensively studied systems' transitions across phases,…

We take a fresh look at analogue-digital systems focussing on their physical behaviour. We model a general analogue-digital system as a physical process controlled by an algorithm by viewing the physical process as physical oracle to the…

Systems and Control · Computer Science 2018-04-17 E. J. Beggs , J. V. Tucker

It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of…

Logic in Computer Science · Computer Science 2017-05-31 Harsh Beohar , Sebastian Küpper