Method and device for obtaining LTLf minimum automaton, and computer readable storage medium

An automaton, the smallest technology, applied in the field of obtaining LTLf smallest automata, equipment, and computer-readable storage media, can solve problems such as time and space loss, high complexity, and state explosion, and achieve the effect of improving the structure

Pending Publication Date: 2022-04-19
上海工业控制安全创新科技有限公司
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the conversion process from LTLf to DFA is extremely complex. An LTLf formula with a length of n can obtain a DFA with a double-exponential number of states with n in the worst case, which brings about the problem of state explosion, which will lead to a lot of time and space wasted
The current m

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
  • Method and device for obtaining LTLf minimum automaton, and computer readable storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] In conjunction with the following specific embodiments and accompanying drawings, the invention will be further described in detail. The process, conditions, experimental methods, etc. for implementing the present invention, except for the content specifically mentioned below, are common knowledge and common knowledge in this field, and the present invention has no special limitation content.

[0042] The invention proposes a construction method from a finite linear temporal logic LTLf (Linear Temporal Logic overfinite traces) to a minimized finite state automaton DFA (Deterministic Finite Automata). The method is based on Brzozowski's minimal automaton construction theory to complete LTLf to minimal DFA construction. Including: for a given LTLf formula, first use the tool MONA to construct the reverse deterministic automaton corresponding to LTLf, this automaton can receive the reverse sequence of the original LTLf receiving language; reverse the reverse deterministic ...

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 provides a method for obtaining an LTLf minimum automaton. According to the method, LTLf to minimum DFA construction is completed on the basis of a Brzozowski minimum automaton construction theory. Comprising the steps that for a given LTLf formula, firstly, a reverse deterministic automaton corresponding to LTLf is constructed through a tool MONA, and the automaton can receive a reverse sequence of an original LTLf receiving language; the method comprises the steps that a reverse deterministic automaton is obtained, the reverse deterministic automaton is inverted, and therefore a non-deterministic finite state automaton (NFA) is obtained; subset construction method calculation is performed on the NFA, and reachable state calculation is performed after the calculation, thereby deleting all unreachable states. According to the Brzozowski theory, the DFA is the minimum DFA corresponding to the LTLf formula.

Description

technical field [0001] The invention relates to the technical field of conversion from LTLf to automaton DFA. Using Brzozowski's minimum automaton construction theory, the first LTLf to minimum DFA conversion method based on Brzozowski theory is proposed, which avoids the direct conversion from LTLf to non- Minimizing the double exponential growth of the DFA and the subsequent minimization process can improve the conversion performance of LTLf to the minimum DFA. Background technique [0002] Finite linear temporal logic LTLf is a commonly used property description language in the field of artificial intelligence robots. The conversion of LTLf to finite state automaton DFA is a key process that LTLf often encounters in application scenarios, and sometimes is even indispensable. However, the conversion process from LTLf to DFA is extremely complex. An LTLf formula with a length of n can obtain a DFA with a double-exponential number of states with n in the worst case, which b...

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): G06F8/40
CPCG06F8/40
Inventor 朱淑芳卢卡斯 M.塔巴雅拉蒲戈光摩西 Y.瓦尔迪刘虹倪华杨昆
Owner 上海工业控制安全创新科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap