Sökning: "reachable set"

Visar resultat 1 - 5 av 18 avhandlingar innehållade orden reachable set.

  1. 1. Stochastic Invariance and Aperiodic Control for Uncertain Constrained Systems

    Författare :Yulong Gao; Karl H. Johansson; Alessandro Abate; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; controlled invariant set; stochastic system; constraint; uncertainty; reachable set; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Uncertainties and constraints are present in most control systems. For example, robot motion planning and building climate regulation can be modeled as uncertain constrained systems. In this thesis, we develop mathematical and computational tools to analyze and synthesize controllers for such systems. LÄS MER

  3. 2. Regular model checking

    Författare :Marcus Nilsson; Bengt Jonsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular length-preserving relation on strings. LÄS MER

  4. 3. Automatic Verification of Parameterized Systems by Over-Approximation

    Författare :Vladislavs Jahundovics; Ulf Nilsson; Cristina Seceleanu; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. LÄS MER

  5. 4. Compact Constraints for Verification of Well Quasi-Ordered Programs

    Författare :Aletta Nylén; Parosh Abdulla; Kaisa Sere; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

    Sammanfattning : In this thesis we present algorithms and constraint systems for efficient verification of infinite-state transition systems that are monotonic with respect to a well quasi-ordering. A major problem in verification of infinite-state systems is constraint explosion, that is, the number of constraints generated during analysis is too large. LÄS MER

  7. 5. A systematic approach to abstract interpretation of logic programs

    Författare :Ulf Nilsson; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The notion of abstract interpretation facilitates a formalized process of approximating meanings of programs. Such approximations provide a basis for inferring properties of programs. LÄS MER