Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

3 results about "Extended finite-state machine" patented technology

In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In an extended finite state machine (EFSM) model, the transition can be expressed by an “if statement” consisting of a set of trigger conditions. If trigger conditions are all satisfied, the transition is fired, bringing the machine from the current state to the next state and performing the specified data operations.

A test case automatic generation system based on probability extended finite state machine

ActiveCN115757105BError detection/correctionSystem under testContext variable
The application provides a test case automatic generation system based on a probability extended finite state machine, which can improve the efficiency and quality of test case generation, and finally generates test cases through probability selection on the processed PEFSM model. The system comprises a PEFSM model construction module, a removing unfeasible path module and a test case probability generation module. The PEFSM model construction module obtains relevant data for constructing a model from a user historical operation record database according to the requirement specification and interface design of a system under test, and outputs a PEFSM model describing the behavior of the system under test. The removing unfeasible path module takes the PEFSM model as input, adopts an evaluation path feasibility measurement method to identify and remove unfeasible paths in the PEFSM model, and outputs a reliable test path set formed by a transition path set. The test case probability generation module takes the reliable test path set as input, initializes context variables, and instantiates test paths in the path set to obtain test cases of the system under test.
Owner:BEIJING INST OF TECH

An information security knowledge modeling method for intelligent devices

The application discloses a kind of information security knowledge modeling methods for intelligent device, first the information technology work of intelligent device is abstracted as an information item to describe, according to the connection between each information technology artifact in intelligent device information technology system Information item between the adjacency matrix is obtained, to generate information technology system model;The permission and attack category of attacker are described, and the information security knowledge model of intelligent device is generated based on the extended finite state machine, and the state set and conversion set in the information security knowledge model are generated based on the information in the generated information technology system model, to complete the construction of information security knowledge model.The present application is based on the knowledge of network attack and intelligent device vulnerability, and the intelligent device is abstracted and modeled for security testing activity to obtain the intelligent device information security knowledge model, to facilitate the automatic generation of test case and other information during subsequent information security testing, to provide support for tester.
Owner:GUANGDONG WEICHEN INFORMATION TECH CO LTD

A Finite State Machine-Based Cooperative Service Allocation Method for Low-Earth Orbit Satellite Clusters

This invention proposes a collaborative service allocation method for low-Earth orbit (LEO) satellite constellations based on finite state machines, belonging to the field of LEO satellite constellation technology. First, this invention constructs an extended finite state machine spatiotemporal graph model to accurately represent on-board resources and state transitions while shielding the dynamics of LEO satellites. Then, a directed acyclic graph (DAG) model is used to represent services, establishing a graph mapping relationship between the DAG and the extended finite state machine spatiotemporal graph, and establishing a latency optimization problem. Finally, a constrained selection adaptive binary particle swarm optimization algorithm is used to solve the latency optimization problem of the graph mapping relationship, finding the mapping strategy with the lowest latency to complete the collaborative service allocation of the satellite constellation. This invention is designed for LEO satellite constellation scenarios. The service collaborative computation based on finite state machines meets the computational requirements of latency-sensitive services in these scenarios, effectively overcomes the heterogeneity of LEO satellite networks, and achieves latency optimization for LEO satellites during simultaneous transmission and computation.
Owner:THE 54TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORPORATION