Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "state theory" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
On the realization theory of polynomial matrices and the algebraic structure of pure generalized state space systems
Autorzy:
Vardulakis, A. I. G.
Karampetakis, N. P.
Antoniou, E. N.
Tictopoulou, E.
Powiązania:
https://bibliotekanauki.pl/articles/907853.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
macierz wielomianowa
nierozkładalność
przestrzeń stanu
polynomial matrices
realization theory
minimality
irreducibility
generalized state space
infinite decoupling zeros
Opis:
We review the realization theory of polynomial (transfer function) matrices via 'pure' generalized state space system models. The concept of an irreducible-at-infinity generalized state space realization of a polynomial matrix is defined and the mechanism of the 'cancellations' of 'decoupling zeros at infinity' is closely examined. The difference between the concepts of irreducibility and minimality of generalized state space realizations of polynomial (transfer function) matrices is pointed out and the associated concepts of dynamic and non-dynamic variables appearing in generalized state space realizations are also examined.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 1; 77-88
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New fault tolerant control strategies for nonlinear Takagi-Sugeno systems
Autorzy:
Ichalal, D.
Marx, B.
Ragot, J.
Maquin, D.
Powiązania:
https://bibliotekanauki.pl/articles/331456.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model Takagi-Sugeno
sterowanie tolerujące uszkodzenia
uszkodzenie równoczesne
estymacja stanu
twierdzenie Lapunowa
Takagi-Sugeno model
fault tolerant control
simultaneous fault
state estimation
Polya's theorem
Lyapunov theory
input to state stability
Opis:
New methodologies for Fault Tolerant Control (FTC) are proposed in order to compensate actuator faults in nonlinear systems. These approaches are based on the representation of the nonlinear system by a Takagi-Sugeno model. Two control laws are proposed requiring simultaneous estimation of the system states and of the occurring actuator faults. The first approach concerns the stabilization problem in the presence of actuator faults. In the second, the system state is forced to track a reference trajectory even in faulty situation. The control performance depends on the estimation quality; indeed, it is important to accurately and rapidly estimate the states and the faults. This task is then performed with an Adaptive Fast State and Fault Observer (AFSFO) for the first case, and a Proportional-Integral Observer (PIO) in the second. Stability conditions are established with Lyapunov theory and expressed in a Linear Matrix Inequality (LMI) formulation to ease the design of FTC. Furthermore, relaxed stability conditions are given with the use of Polya's theorem. Some simulation examples are given in order to illustrate the proposed approaches.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 1; 197-210
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generation of synchronizing state machines from a transition system: A region-based approach
Autorzy:
Teren, Viktor
Cortadella, Jordi
Villa, Tiziano
Powiązania:
https://bibliotekanauki.pl/articles/2201022.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
transition system
Petri net
state machine
theory of regions
SAT
pseudo Boolean optimization
układ przejściowy
sieć Petriego
maszyna stanów
teoria regionów
Opis:
Transition systems (TSs) and Petri nets (PNs) are important models of computation ubiquitous in formal methods for modeling systems. A crucial problem is how to extract, from a given TS, a PN whose reachability graph is equivalent (with a suitable notion of equivalence) to the original TS. This paper addresses the decomposition of transition systems into synchronizing state machines (SMs), which are a class of Petri nets where each transition has one incoming and one outgoing arc. Furthermore, all reachable markings (non-negative vectors representing the number of tokens for each place) of an SM have only one marked place with only one token. This is a significant case of the general problem of extracting a PN from a TS. The decomposition is based on the theory of regions, and it is shown that a property of regions called excitation-closure is a sufficient condition to guarantee the equivalence between the original TS and a decomposition into SMs. An efficient algorithm is provided which solves the problem by reducing its critical steps to the maximal independent set problem (to compute a minimal set of irredundant SMs) or to satisfiability (to merge the SMs). We report experimental results that show a good trade-off between quality of results vs. computation time.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 133--149
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies