Related papers: Conditional Transition Systems with Upgrades
Many natural and technological systems fail to adapt to changing external conditions and move to a different state if the conditions vary too fast. Such "non-adiabatic" processes are ubiquitous, but little understood. We identify these…
We present a lattice of distributed program specifications, whose ordering represents implementability/refinement. Specifications are modelled by families of subsets of relative execution traces, which encode the local orderings of state…
In computer science, there is a distinction between closed systems, whose behavior is totally determined in advance, and open systems, that are systems maintaining a constant interaction with an unspecified environment. Closed systems are…
CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel…
Testing on reactive systems is a well-known laborious activity on software development due to their asynchronous interaction with the environment. In this setting model based testing has been employed when checking conformance and…
The topological properties of open quantum lattice systems have attracted much attention, due to their fundamental significance and potential applications. However, experimental demonstrations with large-scale lattice models remain…
Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switching linear dynamical system (SLDS) and the switching vector…
We present a theory of environmental bisimilarity for the delimited-control operators {\it shift} and {\it reset}. We consider two different notions of contextual equivalence: one that does not require the presence of a top-level control…
We propose a notion of convergence-sensitive bisimulation that is built just over the notions of (internal) reduction and of (static) context. In the framework of timed CCS, we characterise this notion of `contextual' bisimulation via the…
The microscopic model in which nodes interacting with each other are statistical systems is introduced. The nodes conditions are connected with a string of distinct microscopic configurations and depend on external parameters (pressure and…
We investigate quantum phase transitions in ladders of spin 1/2 particles by engineering suitable matrix product states for these ladders. We take into account both discrete and continuous symmetries and provide general classes of such…
Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger…
Reachability analysis for hybrid systems is an active area of development and has resulted in many promising prototype tools. Most of these tools allow users to express hybrid system as automata with a set of ordinary differential equations…
Transition probabilities for a class of two level systems described by explicitly time dependent Hamiltonians are considered. Provided only that the approach to the infinite time limit is non-trivial falling at least as fast as 1/t for…
The theory of bounded, distributive lattices provides the appropriate language for describing directionality and asymptotics in dynamical systems. For bounded, distributive lattices the general notion of `set-difference' taking values in a…
Many climate subsystems are thought to be susceptible to tipping - and some might be close to a tipping point. The general belief and intuition, based on simple conceptual models of tipping elements, is that tipping leads to reorganization…
Lower semi-continuity (\texttt{LSC}) is a critical assumption in many foundational optimisation theory results; however, in many cases, \texttt{LSC} is stronger than necessary. This has led to the introduction of numerous weaker continuity…
Transition systems are often used to describe the behaviour of software systems. If viewed as a graph then, at their most basic level, vertices correspond to the states of a program and each edge represents a transition between states via…
A central goal of probabilistic programming languages (PPLs) is to separate modelling from inference. However, this goal is hard to achieve in practice. Users are often forced to re-write their models in order to improve efficiency of…
We discuss matching control laws for underactuated systems. We previously showed that this class of matching control laws is completely charactarized by a linear system of first order partial differential equations for one set of variables…