Results 1 - 10
of
49,618
Software Failure Avoidance Using Discrete Control Theory
, 2009
"... When I shifted my research interest from the theoretical study of discrete event systems to applications of this theory, few believed that the marriage of Discrete Control Theory to computer systems would be successful. Fortunately, Terence Kelly was one of them. I am deeply grateful for his long-te ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
When I shifted my research interest from the theoretical study of discrete event systems to applications of this theory, few believed that the marriage of Discrete Control Theory to computer systems would be successful. Fortunately, Terence Kelly was one of them. I am deeply grateful for his long
Detectability of Discrete Event Systems
"... In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial ev ..."
Abstract
-
Cited by 806 (14 self)
- Add to MetaCart
for these detectabilities. These conditions can be checked by constructing an observer, which models the estimation of states under different observations. The theory developed in this paper can be used in feedback control and diagnosis. If the system is detectable, then the observer can be used as a diagnoser to diagnose
Discrete Multivariate Analysis: Theory and Practice
, 1975
"... the collaboration of Richard J. Light and Frederick Mosteller. ..."
Abstract
-
Cited by 836 (47 self)
- Add to MetaCart
the collaboration of Richard J. Light and Frederick Mosteller.
Convolution Kernels on Discrete Structures
, 1999
"... We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes the fa ..."
Abstract
-
Cited by 506 (0 self)
- Add to MetaCart
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on pur ..."
Abstract
-
Cited by 685 (12 self)
- Add to MetaCart
A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied
The theory of planned behavior
- Organizational Behavior and Human Decision Processes
, 1991
"... Research dealing with various aspects of * the theory of planned behavior (Ajzen, 1985, 1987) is reviewed, and some unresolved issues are discussed. In broad terms, the theory is found to be well supported by empirical evidence. Intentions to perform behaviors of different kinds can be predicted wit ..."
Abstract
-
Cited by 2754 (9 self)
- Add to MetaCart
Research dealing with various aspects of * the theory of planned behavior (Ajzen, 1985, 1987) is reviewed, and some unresolved issues are discussed. In broad terms, the theory is found to be well supported by empirical evidence. Intentions to perform behaviors of different kinds can be predicted
Quantum complexity theory
- in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
to be specified. We prove that O(log T) bits of precision suffice to support a T step computation. This justifies the claim that the quantum Turing machine model should be regarded as a discrete model of computation and not an analog one. We give the first formal evidence that quantum Turing machines violate
Multivariable Feedback Control: Analysis
- span (B∗) und Basis B∗ = { ω1
, 2005
"... multi-input, multi-output feed-back control design for linear systems using the paradigms, theory, and tools of robust con-trol that have arisen during the past two decades. The book is aimed at graduate students and practicing engineers who have a basic knowledge of classical con-trol design and st ..."
Abstract
-
Cited by 564 (24 self)
- Add to MetaCart
multi-input, multi-output feed-back control design for linear systems using the paradigms, theory, and tools of robust con-trol that have arisen during the past two decades. The book is aimed at graduate students and practicing engineers who have a basic knowledge of classical con-trol design
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract
-
Cited by 2651 (32 self)
- Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis
Results 1 - 10
of
49,618