Sökning: "Linear Temporal Logic"

Visar resultat 1 - 5 av 6 avhandlingar innehållade orden Linear Temporal Logic.

  1. 1. Hybrid Control of Multi-robot Systems under Complex Temporal Tasks

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Meng Guo; KTH.; [2015]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Automatic Control; Multi-robot system; Linear Temporal Logic; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Autonomous robots like household service robots, self-driving cars and dronesare emerging as important parts of our daily lives in the near future. They need tocomprehend and fulfill complex tasks specified by the users with minimal humanintervention. Also they should be able to handle un-modeled changes and contingentevents in the workspace. LÄS MER

  2. 2. Cooperative Motion and Task Planning Under Temporal Tasks

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Meng Guo; KTH.; [2014]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Temporal-logic-based languages provide a formal and accurate way to specify complex motion and action missions for autonomous robots, beyond the classic point-to-point navigation task. The first part of the thesis is devoted to the nominal scenario: an autonomous robot is given a motion task specified as Linear-time Temporal Logic (LTL) formulas. LÄS MER

  3. 3. Regular Model Checking

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Marcus Nilsson; Uppsala universitet.; Uppsala universitet.; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal methods; model checking; verification; regular sets; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Sammanfattning : A major current challenge in the area of program verification is to extend its applicability to infinite-state systems. A system can be infinite-state because it operates on unbounded data structures, such as queues, stacks, integers, etc., or because its description is parameterized by the number of components inside the system. LÄS MER

  4. 4. Verifying Absence of ∞ Loops in Parameterized Protocols

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Mayank Saksena; Uppsala universitet.; Uppsala universitet.; [2008]
    Nyckelord :formal methods; verification; model checking; infinite-state systems; regular model checking; liveness; graph transformation;

    Sammanfattning : The complex behavior of computer systems offers many challenges for formal verification. The analysis quickly becomes difficult as the number of participating processes increases.A parameterized system is a family of systems parameterized on a number n, typically representing the number of participating processes. LÄS MER

  5. 5. Model Checking Methods for Mode Switching Systems

    Detta är en avhandling från Linköping : Linköping University

    Författare :Valur Einarsson; Linköpings universitet.; Linköpings universitet.; [2000]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : This thesis deals with modeling and analysis of a special class of hybrid systems, i.e., systems displaying behavior of both continuous and discrete nature. LÄS MER