View in EDS

Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration.

Saved in:
Bibliographic Details
Title: Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration.
Authors: Cattaruzza, Dario1, Abate, Alessandro1 aabate@cs.ox.ac.uk, Schrammel, Peter2, Kroening, Daniel1
Source: Journal of Automated Reasoning. Feb2021, Vol. 65 Issue 2, p157-203. 47p.
Subjects: Dynamic models, Linear time invariant systems, Time perspective, Linear programming, Semantics
Abstract: Reachability analysis of dynamical models is a relevant problem that has seen much progress in the last decades, however with clear limitations pertaining to the nature of the dynamics and the soundness of the results. This article focuses on sound safety verification of unbounded-time (infinite-horizon) linear time-invariant (LTI) models with inputs using reachability analysis. We achieve this using counterexample-guided Abstract Acceleration: this approach over-approximates the reachability tube of the LTI model over an unbounded time horizon by using abstraction, possibly finding concrete counterexamples for refinement based on the given safety specification. The technique is applied to a number of LTI models and the results show robust performance when compared to state-of-the-art tools. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 148892240
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cattaruzza%2C+Dario%22">Cattaruzza, Dario</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Abate%2C+Alessandro%22">Abate, Alessandro</searchLink><relatesTo>1</relatesTo><i> aabate@cs.ox.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Schrammel%2C+Peter%22">Schrammel, Peter</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Kroening%2C+Daniel%22">Kroening, Daniel</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Automated+Reasoning%22">Journal of Automated Reasoning</searchLink>. Feb2021, Vol. 65 Issue 2, p157-203. 47p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Dynamic+models%22">Dynamic models</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+time+invariant+systems%22">Linear time invariant systems</searchLink><br /><searchLink fieldCode="DE" term="%22Time+perspective%22">Time perspective</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Reachability analysis of dynamical models is a relevant problem that has seen much progress in the last decades, however with clear limitations pertaining to the nature of the dynamics and the soundness of the results. This article focuses on sound safety verification of unbounded-time (infinite-horizon) linear time-invariant (LTI) models with inputs using reachability analysis. We achieve this using counterexample-guided Abstract Acceleration: this approach over-approximates the reachability tube of the LTI model over an unbounded time horizon by using abstraction, possibly finding concrete counterexamples for refinement based on the given safety specification. The technique is applied to a number of LTI models and the results show robust performance when compared to state-of-the-art tools. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=148892240
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10817-020-09562-z
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 47
        StartPage: 157
    Subjects:
      – SubjectFull: Dynamic models
        Type: general
      – SubjectFull: Linear time invariant systems
        Type: general
      – SubjectFull: Time perspective
        Type: general
      – SubjectFull: Linear programming
        Type: general
      – SubjectFull: Semantics
        Type: general
    Titles:
      – TitleFull: Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cattaruzza, Dario
      – PersonEntity:
          Name:
            NameFull: Abate, Alessandro
      – PersonEntity:
          Name:
            NameFull: Schrammel, Peter
      – PersonEntity:
          Name:
            NameFull: Kroening, Daniel
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2021
              Type: published
              Y: 2021
          Identifiers:
            – Type: issn-print
              Value: 01687433
          Numbering:
            – Type: volume
              Value: 65
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Journal of Automated Reasoning
              Type: main
ResultId 1