A Modeling Verification Method for Historical Transactions
A verification method and historical technology, applied in the field of Internet of Things, can solve the problem that linear sequential logic cannot detect time and so on
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0031] The history is organized as a list of sessions, each session is a finite collection of events or actions, and each event is represented by a predicate. Variable composition is interpreted as multi-ordered function symbols. Function symbols without parameters are called constants, which are represented by a, b, c, and d, and term variables are represented by x, y, and z, which can represent integers, strings, etc. Use prop to represent the set of propositional logic; use f, g, h to represent the function symbols of one or more parameters; use R to represent some relational operators, such as , etc., the specific expressions are as follows:
[0032]
[0033] where X -1 Indicates the "before" operator and S indicates the "since" operator. quantification formula
[0034] p stands for tau 1 ×...×τ n → n-ary predicates of type prop each x i is τ i type. The purpose of this quantification is to explain that the predicate p defines a subtype τ 1 ×...×τ n , which ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


