) and apply it to a biquad low-pass filter. To analyze more complex circuits, we resort to bounded horizon verification. We use optimal control techniques to check whether a ∆-Σ modulator, modeled as a discrete-time hybrid automaton, admits an input sequence of bounded length that drives it to saturation. 1

In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications suffi-cient to describe a wide range of properties including safety, stability, progress, obligation, response and guarantee. The resulting embedded control software consists of a

This work is concerned with the computation of probabilis-tic invariance (or safety) over a finite horizon for mixed deterministic-stochastic, discrete-time processes over a con-tinuous state space. The models of interest are made up of two sets of (possibly coupled) variables: the first set

that acceptance of the complex chain of argument involved does not imply possible experimental verification of multiverses at the present time. Rather this claim relates only to theoretically possible observations in the very far future of the universe. A recent book by Susskind [1] presents interesting arguments

1 Introduction The Java Card architecture for smart cards [2] allows new applications, called applets, to be downloaded into smart-cards. While bringing considerable flexibility and extending the horizons of smart-card usage this post issuance feature raises major security issues. Upon

A central computational issue in solving infinite-horizon nonlinear optimal control problems is the treatment of the horizon. In this paper, we directly address this issue by a domain transformation technique that maps the infinite horizon to a finite horizon. The transformed finite horizon serves

An embedded software controller is safe if the composition of the controller and the plant does not reach any unsafe state starting from legal initial states (in an unbounded time hori-zon). Linear systems – specified using linear ordinary differ-ential or difference equations – form an important

While bringing considerable flexibility and extending the horizons of mobile computing, mobile code raises major security issues.

This paper studies the problem of the deterministic version of the Verification Theorem for the optimal m-states switching in infinite horizon under Markovian framework with arbitrary switching cost functions. The problem is formulated as an extended impulse control problem and solved by means

While bringing considerable exibility and extending the horizons of mobile computing, mobile code raises major security issues. Hence, mobile code, such as Jave applets...