Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Bounded model inspection method based on expanded linear time invariance

A model checking and period technology, applied in the field of bounded model checking, to achieve good efficiency, eliminate sampling error, and low algorithm complexity

Inactive Publication Date: 2017-10-24
TONGJI UNIV
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] Existing algorithm technologies often have high-order exponential complexity, and reducing algorithm complexity is the most critical part of this type of inspection problem

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Bounded model inspection method based on expanded linear time invariance
  • Bounded model inspection method based on expanded linear time invariance
  • Bounded model inspection method based on expanded linear time invariance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0043] Such as figure 1 As shown, a bounded model checking method based on the extended linear period invariant includes the following steps:

[0044] S1, according to the timed automaton T and the extended linear period invariant formula Φ under the given discrete time semantics, construct the auxiliary automaton H, which is used to calculate the observation time of the auxiliary automaton H for the timed automaton T;

[0045] S2, within the range set by the observation time, detect whether the time automaton T at each integer time point satisfies the formula Φ, and obtain the set of states that do not satisfy the formula Φ;

[0046] S3, defining a computational tree temporal logic formula for describing the properties of the set obtained in step S2;

[0047] S4. Check whether the product composed of the timed automaton T and the auxiliary automaton H, namely T||H, satisfies the temporal logic formula of the calculation tree obtained in step S3. If not, the timed automaton T...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a bounded model inspection method based on an expanded linear time invariance, which includes steps of S1, structuring an assistant automat H according to a time automat T under a given discrete time semantics and an expanded linear time invariance formula phi; S2, detecting if the time automat T of every integer time point meets the formula phi within the setting scale of the observation time, and acquiring a set which disagrees with the state of the formula phi; S3, defining a logical formula of a calculating tree for describing the characteristics of the set; S4, detecting if the constituting product of the time automat T and the assistant automat H can meet the logical formula of the calculating tree; if it does not meet, the time automat T meets the an expanded linear time invariance formula phi; otherwise, the automat T does not meet the expanded linear time invariance formula phi. Compared with the prior art, the bounded model inspection method has better efficiency and lower algorithm complexity.

Description

technical field [0001] The invention relates to a bounded model checking method under a discrete time semantic environment, in particular to a bounded model checking method based on an extended linear period invariant. Background technique [0002] Model checking (model checking) is an emerging technology that constructs a system in a formal way and automatically detects whether the system meets certain expectations. The basic idea of ​​model checking can be summarized as follows: model the system that needs to be analyzed, then strictly express the system requirements with mathematical logic, and finally test whether the logical expressions of these requirements are established on the established model. In this way, the question "whether the system has the desired properties" is transformed into a mathematical question "whether the state transition system S is a model of formula F". For finite state systems, this problem is decidable, that is, it can be automatically deter...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/50
CPCG06F30/3323G06F2111/04
Inventor 张苗苗徐立云张剑朱芳来施枫
Owner TONGJI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com