English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A deductive model checking approach for hybrid systems

Nonnengart, A.(1999). A deductive model checking approach for hybrid systems (MPI-I-1999-2-006). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-6F5B-0 Version Permalink: https://hdl.handle.net/21.11116/0000-0001-75A7-F
Genre: Report

Files

show Files
hide Files
:
MPI-I-1999-2-006.pdf (Any fulltext), 429KB
View   Save
File Permalink:
https://hdl.handle.net/21.11116/0000-0001-75A8-E
Name:
MPI-I-1999-2-006.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Nonnengart, Andreas1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: In this paper we propose a verification method for hybrid systems that is based on a successive elimination of the various system locations involved. Briefly, with each such elimination we compute a weakest precondition (strongest postcondition) on the predecessor (successor) locations such that the property to be proved cannot be violated. This is done by representing a given verification problem as a second-order predicate logic formula which is to be solved (proved valid) with the help of a second-order quantifier elimination method. In contrast to many ``standard'' model checking approaches the method as described in this paper does not perform a forward or backward reachability analysis. Experiments show that this approach is particularly interesting in cases where a standard reachability analysis would require to travel often through some of the given system locations. In addition, the approach offers possibilities to proceed where ``standard'' reachability analysis approaches do not terminate.

Details

show
hide
Language(s): eng - English
 Dates: 1999
 Publication Status: Issued
 Pages: 40 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-1999-2-006
BibTex Citekey: MPI-I-1999-2-006
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -