@phdthesis{Schoenlein2012,
  author    = {Sch{\"o}nlein, Michael},
  title     = {Stability and Robustness of Fluid Networks: A Lyapunov Perspective},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-72235},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2012},
  abstract  = {In the verification of positive Harris recurrence of multiclass queueing networks the stability analysis for the class of fluid networks is of vital interest. This thesis addresses stability of fluid networks from a Lyapunov point of view. In particular, the focus is on converse Lyapunov theorems. To gain an unified approach the considerations are based on generic properties that fluid networks under widely used disciplines have in common. It is shown that the class of closed generic fluid network models (closed GFNs) is too wide to provide a reasonable Lyapunov theory. To overcome this fact the class of strict generic fluid network models (strict GFNs) is introduced. In this class it is required that closed GFNs satisfy additionally a concatenation and a lower semicontinuity condition. We show that for strict GFNs a converse Lyapunov theorem is true which provides a continuous Lyapunov function. Moreover, it is shown that for strict GFNs satisfying a trajectory estimate a smooth converse Lyapunov theorem holds. To see that widely used queueing disciplines fulfill the additional conditions, fluid networks are considered from a differential inclusions perspective. Within this approach it turns out that fluid networks under general work-conserving, priority and proportional processor-sharing disciplines define strict GFNs. Furthermore, we provide an alternative proof for the fact that the Markov process underlying a multiclass queueing network is positive Harris recurrent if the associate fluid network defining a strict GFN is stable. The proof explicitely uses the Lyapunov function admitted by the stable strict GFN. Also, the differential inclusions approach shows that first-in-first-out disciplines play a special role.},
  subject      = {Warteschlangennetz},
  language  = {en}
}
@unpublished{GeiselhartGielenLazaretal.2013,
  author    = {Geiselhart, Roman and Gielen, Rob H. and Lazar, Mircea and Wirth, Fabian R.},
  title     = {An Alternative Converse Lyapunov Theorem for Discrete-Time Systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-78512},
  year      = {2013},
  abstract  = {This paper presents an alternative approach for obtaining a converse Lyapunov theorem for discrete-time systems. The proposed approach is constructive, as it provides an explicit Lyapunov function. The developed converse theorem establishes existence of global Lyapunov functions for globally exponentially stable (GES) systems and semi-global practical Lyapunov functions for globally asymptotically stable systems. Furthermore, for specific classes of sys- tems, the developed converse theorem can be used to establish non-conservatism of a particular type of Lyapunov functions. Most notably, a proof that conewise linear Lyapunov functions are non-conservative for GES conewise linear systems is given and, as a by-product, tractable construction of polyhedral Lyapunov functions for linear systems is attained.},
  subject      = {Ljapunov-Funktion},
  language  = {en}
}
@phdthesis{Geiselhart2015,
  author    = {Geiselhart, Roman},
  title     = {Advances in the stability analysis of large-scale discrete-time systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-112963},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2015},
  abstract  = {Several aspects of the stability analysis of large-scale discrete-time systems are considered. An important feature is that the right-hand side does not have have to be continuous. In particular, constructive approaches to compute Lyapunov functions are derived and applied to several system classes. For large-scale systems, which are considered as an interconnection of smaller subsystems, we derive a new class of small-gain results, which do not require the subsystems to be robust in some sense. Moreover, we do not only study sufficiency of the conditions, but rather state an assumption under which these conditions are also necessary. Moreover, gain construction methods are derived for several types of aggregation, quantifying how large a prescribed set of interconnection gains can be in order that a small-gain condition holds.},
  subject      = {Ljapunov-Funktion},
  language  = {en}
}