Model Checking Apparatus for Distributed Environment Models
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current model checking techniques, such as DPOR-DS, may generate wasteful searches due to the inability to always execute the first transition sequence specified upon resumption of a search by backtracking, leading to inefficient verification processes in distributed-environment models.
Innovation Solution
A distributed-environment-model checking apparatus that determines whether to postpone execution of a predetermined transition, analyzes dependency and happens-before relations, and generates information for delayed transition execution based on these analyses, thereby avoiding wasteful searches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If DPOR-DS specifies a first transition sequence upon resumption of search by backtracking, then redundant searches are reduced, but wasteful searches occur when the specified transition sequence cannot be executed
Solution Approach 1:
The patent makes the transition execution sequence dynamic and adaptive. Instead of specifying a fixed first transition sequence, the system determines the transition sequence based on the current system state and executability conditions at runtime. This allows the search to adapt to actual system conditions, ensuring that only executable transitions are pursued while maintaining reduced redundancy through state-aware sequencing.
Solution Approach 2:
The patent performs preliminary analysis of transition executability conditions before committing to a search sequence. By evaluating whether transitions can actually be executed from the current state beforehand, the system prepares a valid transition sequence that avoids wasteful searches while still benefiting from reduced redundancy through预先规划.
2Reliability
If model checking exhaustively searches the state transition system, then verification completeness is improved, but memory and time requirements increase exponentially
Solution Approach 1:
The patent extracts and eliminates redundant search paths from the exhaustive search process. By identifying and removing equivalent or unnecessary state transitions through dependency analysis and happens-before relations, the system maintains verification completeness for unique paths while significantly reducing the time spent on redundant explorations.
Solution Approach 2:
The patent applies partial search strategies by focusing computational resources on non-redundant paths. Instead of uniformly exploring all possible transitions, the system selectively pursues only those transitions that contribute to verification completeness, performing partial searches on redundant paths that have already been adequately explored through other execution sequences.
Data Source
AI summary
In a model check with respect to a distributed environment model, in order to reduce redundant search, wasteful search is avoided and efficient search is enabled. A model checking apparatus is provided with: a distributed environment model search unit that, when searching a distributed environment model by model checking, performs the search while determining whether execution with respect to a predetermined transition should be postponed; a distributed environment model dependency relationship analysis unit that analyzes a dependency relationship and a happens-before relationship with respect to a plurality of transitions on a path searched by the distributed environment model search unit, and that generates information about a back track with respect to the path; and a delay transition information providing unit that, on the basis of the information, generates information about the predetermined transition of which execution should be postponed in the search performed, after a back track, by the distributed environment model search unit.