Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
The control of nonholonomic and underactuated systems with symmetry is illustrated by the problem of controlling a bicycle. We derive a controller which, using steering and rear-w...
This paper studies the use of statistical induction techniques as a basis for automated performance diagnosis and performance management. The goal of the work is to develop and ev...
Ira Cohen, Jeffrey S. Chase, Julie Symons, Mois&ea...
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...