Embedded system simulation method and system based on PRES network refinement operation
A technology of embedded system and simulation method, which is applied in the field of embedded system simulation based on PRES network refinement operation, can solve problems such as state space explosion, and achieve the effect of improving efficiency and accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0046] The purpose of this embodiment is to provide an embedded system simulation method based on the PRES network refinement operation.
[0047] A kind of embedded system simulation method based on PRES network refinement operation, comprising:
[0048] Based on the function and module division of the embedded control system, an abstract PRES network model is constructed;
[0049] Determine the place-type subnet in the abstract PRES network model based on relevant constraints;
[0050] Utilize described place type sub-network to carry out refinement operation to described abstract PRES network model, obtain the PRES network model of refinement;
[0051] Based on the refined PRES network model obtained, the simulation of the embedded control system is realized.
[0052] Specifically, for ease of understanding, the solutions described in the present disclosure will be described in detail below in conjunction with the accompanying drawings:
[0053] (1) Overall structure
[...
example 1
[0096] Example 1: Suppose T pp is a transition sequence t 1 ,t 2 ,...,t m . The corresponding transition delays are [d 1 - , d 1 + ], [d 2 - , d 2 + ],...,[d m - , d m + ]. The corresponding transition functions are f 1 , f 2 ,..., f m . Then, the minimum transition set delay is d pp - = d 1 - +d 2 - +...+d m - ; the largest transition set delay is d pp + = d 1 + +d 2 + +...+d m + ; the corresponding transition set function is (in is a compound operator).
[0097] For example in Figure 2(a), T pp ={t 1 ,t 2}. Minimum transition set delay d pp - = d 1 - +d 2 - ; The largest transition set delay is d pp + = d 1 + +d 2 + ; the corresponding transition set function is
example 2
[0098] Example 2: Suppose T pp Contains the parallel transition t 1 ,t 2 ,...,t n . The corresponding transition delays are [d 1 - , d 1 + ], [d 2 - , d 2 + ],...,[d n - , d n + ]. The corresponding transition functions are f 1 , f 2 ,..., f n . Then, the minimum transition set delay is d pp - =max(d 1 - , d 2 - ,...,d n - ); the largest transition set delay is d pp + =max(d 1 + , d 2 + ,...,d n + ); the corresponding transition set function is f pp = f 1 ||f 2 ||...||f n (where || is the concurrency operator).
[0099] For example in Figure 2(b), T pp ={t 1 ,t 2}. Minimum transition set delay d pp - =max(d 1 - , d 2 - ); the largest transition set delay is d pp + =max(d 1 + , d 2 + ); the corresponding transition set function is f pp = f 1 ||f 2 .
[0100] In order to study the property preservation problem of the refinement operation in Section 4 and Section 5, the following assumptions are given for the place subnet...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More