(Enter summary)
Abstract: . Constrained supremum and supremum operators are introduced to obtain a general
procedure for computing supremal elements of upper semilattices. Examples of such elements include
supremal (A, B)-invariant subspaces in linear system theory and supremal controllable sublanguages
in discrete-event system theory. For some examples, we show that the algorithms available in the
literature are special cases of our procedure. Our iterative algorithms may also provide more insight
into applications; in ... (Update)
Similar documents based on text: More All
0.7: Supremum Operators and Computation of Supremal Elements in.. - Zad, Kwong, Wonham (1997)
(Correct)
0.5: On Supervisory Control of Sequential Behaviors - Kumar, Garg (1992)
(Correct)
0.5: Formulas For Calculating Supremal Controllable And .. - Brandt, Garg.. (1990)
(Correct)
BibTeX entry: (Update)
@article{ zad99supremum,
author = "S. Hashtrudi Zad and R. H. Kwong and W. M. Wonham",
title = "Supremum Operators and Computation of Supremal Elements in System Theory",
journal = "SIAM Journal on Control and Optimization",
volume = "37",
number = "3",
pages = "695--709",
year = "1999",
url = "citeseer.ist.psu.edu/zad99supremum.html" }
Citations (may not include all citations):
1911
Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
652
A Discipline of Programming (context) - Dijkstra - 1976
509
Introduction to Lattices and Order (context) - Davey, Priestly - 1990
258
A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
234
Supervisory control of a class of discrete event processes (context) - Ramadge, Wonham - 1987
201
Three partition refinement algorithms (context) - Paige, Tarjan - 1987
141
Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
125
American Mathematical Society (context) - Birkhoff, Theory - 1967
97
the supremal controllable sublanguage of a given language (context) - Wonham, Ramadge - 1987
76
Linear Multivariable Control: A Geometric Approach (context) - Wonham - 1985
65
Finite Transition Systems (context) - Arnold - 1994
60
Algebraic Structure Theory of Sequential Machines (context) - Hartmanis, Stearns - 1966
55
On observability of discrete-event systems (context) - Lin, Wonham - 1988
52
Algebraic Approaches to Program Semantics (context) - Manes, Arbib - 1986
51
Modular feedback logic for discrete event systems (context) - Ramadge, Wonham - 1987
39
Fixed point theorems and semantics: A folk tale (context) - Lassez, Nguyen et al. - 1982
37
Universal Algebra for Computer Scientists (context) - Wechler - 1992
32
On controllability and normality of discrete event dynamical..
- Kumar, Garg et al. - 1991
28
Formulas for calculating supremal controllable and normal su..
- Brandt, Garg et al. - 1990
25
Decentralized supervisory control of discrete-event systems (context) - Lin, Wonham - 1988
17
and three problems of equivalence (context) - Kanellakis, Smolka et al. - 1983
17
Predicates and predicate transformers for supervisory contro..
- Kumar, Garg et al. - 1993
10
Controllability and observability in the state-feedback cont.. (context) - Li, Wonham - 1988
9
Extremal solutions of inequations over lattices with applica..
- Kumar, Garg - 1995
6
cient algorithm for bisimulation equivalence (context) - Fernandez, of - 1989
5
Control of vector discrete-event systems (context) - Li, Wonham - 1993
2
Control of vector discrete-event systems II (context) - Li, Wonham - 1994
2
State-event observers for labeled transition systems (context) - Lawford, Wonham et al. - 1994
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC