Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary (possibly uncountable) state spaces. We consider the sub-probability monad and the probability monad (Giry monad) on the category of measurable spaces ...

A hybrid system is a dynamical system in which states can be changed continuously and discretely. Simulation based on numerical methods is the widely used technique for analyzing complicated hybrid systems. Numerical simulation of hybrid systems, however, is subject to two types of numerical errors: truncation error and round-off error. The effect of such errors can make an impossible transitio...

Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction semantics: we assume to have a representation of the whole system and we compute unlabeled reduction transitions (leading to a distribution over states in the probabilistic case). In this paper we consider mixed models...

Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction semantics: we assume to have a representation of the whole system and we compute unlabeled reduction transitions (leading to a distribution over states in the probabilistic case). In this paper we consider mixed models...

a memory control for t-s fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. a new state space model of the discrete-time t-s fuzzy system is derived by introducing some stocha...

We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a linear and a branching distance on states of such a transition system. We show that our framework generalizes and unifies a large variety of previously considered...

Alternating transition systems are a general model for composite systems which allows the study of collaborative as well as adversarial relationships between individual system components. Unlike in labeled transition systems, where each transition corresponds to a possible step of the system (which may involve some or all components), in alternating transition systems, each transition correspon...

Abs t r ac t . We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I /O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of h...

The difference between the models may be expressed in terms of the parameters according to which models are often classified. For instance, a distinction made explicitly in the theory of Petri nets, but sensible in a wider context, is that between so-called “system” models allowing an explicit representation of the (possibly repeating) states in a system, and “behaviour” models abstracting away...