In this paper, we present the HybridSAL relational abstracter – a tool for verifying continuous and hybrid dynamical systems. The input to the tool is a model of a hybrid dynamical system and a safety property. The output of the tool is a discrete state transition system and a safety property. The correctness guarantee provided by the tool is that if the output property holds for the output dis...

Given a probabilistic transition system (PTS) A partially observed by an attacker, and an ω-regular predicate φ over the traces of A, measuring the disclosure of the secret φ in A means computing the probability that an attacker who observes a run of A can ascertain that its trace belongs to φ. In the context of refinement, we consider specifications given as Interval-valued Discrete Time Marko...

Hybrid systems are continuous variable, continuous time systems with a phased operation. Within each phase the system evolves continuously according to the dynamical law of that phase, and when an event occurs, the system makes a transition from one phase to the next. Thus, hybrid systems display both discrete and continuous behavior. The discrete behavior consists of abrupt transitions between...

We introduce a new approach to model and analyze Mobility. It is fully based on discrete mathematics and yields a class of mobility models, called theMarkov Trace Model. This model can be seen as the discrete version of the Random Trip Model: including all variants of the Random Way-Point Model [14]. We derive fundamental properties and explicit analytical formulas for the stationary distributi...

In this paper the question is considered in which cases a transition system specification in Plotkin style has 'good' properties and deserves the predicate 'structured'. The discussion takes place in a setting of labelled transition systems. The states of the transition systems are terms generated by a single sorted signature and the transitions between states are defined by conditional rules. ...

We present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via determinization, a result interesting in itself. The...

Simulation relations of labeled transition systems are used in theoretical computer science in order to formally establish notions of modeling abstraction and refinement in hierarchical systems. In this paper, we establish and characterize simulation relations for arbitrary discrete-time, linear control systems. More precisely, given two discrete-time systems, we consider various embeddings int...

In this paper, a chattering-free sliding-mode control is mainly proposed in a second-order discrete-time system. For achieving this purpose, firstly, a suitable control law would be derived by using the discrete-time Lyapunov stability theory and the sliding-mode concept. Then the input constraint is taken into account as a saturation function in the proposed control law. In order to guarantee ...

ion of Continuous System to Discrete Event System Using Neural Network Sung Hoon Jung* and Tag Gon Kim, *School of Information and Computer Engineering, Hansung Univ., Seoul, Korea tDepartment of Electrical Engineering, KAIST, Taejon 305-701, Korea ABSTRACT A hybrid system consists of continuous systems and discrete event systems, which interact with each other. In such configuration, a continu...

Discrete transitions, or instantaneous switchings between system configurations, constitute the defining attribute of a hybrid, or switching, system behavior. These transitions have been traditionally viewed as nondynamic. In recent years, however, a realization has started to form that such a simplification does not unambiguously support some basic phenomena exhibited by hybrid systems, such a...