CN113886051A - Multi-task resource conflict detection method based on event stream analysis - Google Patents

Multi-task resource conflict detection method based on event stream analysis Download PDF

Info

Publication number
CN113886051A
CN113886051A CN202111244730.2A CN202111244730A CN113886051A CN 113886051 A CN113886051 A CN 113886051A CN 202111244730 A CN202111244730 A CN 202111244730A CN 113886051 A CN113886051 A CN 113886051A
Authority
CN
China
Prior art keywords
event
task
resource
tasks
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111244730.2A
Other languages
Chinese (zh)
Inventor
胡逸琳
欧阳昭
侯正平
施小敏
张伟欣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai aerospace computer technology research institute
Shanghai Academy of Spaceflight Technology SAST
Original Assignee
Shanghai aerospace computer technology research institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai aerospace computer technology research institute filed Critical Shanghai aerospace computer technology research institute
Priority to CN202111244730.2A priority Critical patent/CN113886051A/en
Publication of CN113886051A publication Critical patent/CN113886051A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/48—Indexing scheme relating to G06F9/48
    • G06F2209/484—Precedence
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/5021—Priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The invention discloses a multi-task resource conflict detection method based on event stream analysis, which constructs event streams according to a software task book and a system environment, and determines a set { M (maximum) of trigger conditions or start time of each event and processing time slices of each event1}; determining all tasks and task running time of software according to software design architecture { M2And resources { M } of runtime invocation of tasks3}; determining the relation of each event calling software task calling according to the software design architecture1}; according to { R1With { M }1Tasks called at coincident time points in the { M } table2Arrange into a set of time points in chronological order { M }4}; form { M3And { M }4A mapping of { C }; obtaining the use frequency band of each resource; whether there are resource conflicts, and the events and tasks that are in conflict. The invention is used for statically detecting the conflict condition of software resources and can be used for radically detecting the conflict condition of the software resourcesAnd accurately positioning software resource conflicts according to the actual application scene of the software, and prompting testers according to the conflicts.

Description

Multi-task resource conflict detection method based on event stream analysis
Technical Field
The invention relates to a multi-task resource conflict detection method based on event stream analysis.
Background
With the advance of software engineering, when the same resource is repeatedly called in multiple events during the implementation of software in a large-scale system, when the same resource is called by multiple events at the same time, resource conflict can be caused to the multiple events, and the conditions that event processing data is abnormal or the event cannot call the resource and errors are caused can be caused. At present, a manual analysis method or a multitask concurrent pressure test method is adopted for analyzing resource conflicts in software testing, but for software with more events, more tasks and more resource interaction among tasks, conflicting resources are sporadic, manual analysis cannot fully cover, and the problems of low efficiency and inaccurate positioning of a conflict detection method exist.
Disclosure of Invention
The invention aims to provide a multi-task resource conflict detection method based on event flow analysis, which is used for comprehensively detecting the resource conflict condition of software, accurately analyzing each task use time period of the software according to the actual application scene of the software, accurately positioning software resource conflicts and prompting software testers according to the conflicting events and tasks.
In order to achieve the above object, the present invention provides a method for detecting a multi-task resource conflict based on event stream analysis, which comprises:
1) the following data are given: event name and its trigger period and handling completion time; the occupied time of each task; the relationship of events and tasks;
2) the data structure model of the set of event time slices { M1}, { M1} is constructed according to the processing completion time of each event: mi1{ti1，type，ci}；
Wherein: ti represents the time slice when the event occurs, type represents whether it is a periodic event, and when type is an accidental event, ci is 0.
3) Constructing a data structure model of a task running time set { M2}, { M2} as Mi2{ ti2, Tk2, Pk2} according to the task running time;
wherein: ti represents the task processing completion time, Tk represents the kth task, and Pk represents the priority of the task;
4) the data structure model of the task call resource condition set { M3}, { M3} is Mi3{ Tk, type, address { addr1, addr2, addr3
Wherein: tk is a task in the M1 sequence, type is a resource use type, and address is a space address corresponding to the resource.
5) The data structure model of an event-task relationship set { R1}, { R1} is Ri1{ Tk1, Ma2, Mb2, Mc2, … … } according to the relationship of tasks to be called in each event;
wherein: tk represents the kth event, Mk2 represents the task set model corresponding to { M2} for the Tk event;
6) will { M2The tasks in { M } are according to the relation of { R1}, in1Sequencing the event period, the event priority and the event sequence number to form a set { M4} of a new task time slice sequence, wherein the data structure model of the set { M4} is as follows: mi 3{Mi 1，Ma 2，Mb 2，Mc 2，……}；
Wherein M isk 1Representing a current event correspondence { M1Event model of { M }, Mk 2Representing a current event correspondence { M2And { M }3A corresponding task set model;
7) calculating the time period of each event in M1 in M4 for calling the resource, and the time period of each task in M2 for calling the resource;
on the basis of the above analysis, the following data were obtained:
maximum time occupied by each event for each resource;
the utilization rate of each resource when the software runs;
whether there are resource conflicts, and the events and tasks that are in conflict.
The method for detecting the multi-task resource conflict is characterized in that in the step 4), TK corresponds to the member in the { M1 }.
The method for detecting the multi-task resource conflict is characterized in that in the step 5), TK1 should correspond to a member in { M1}, and { M2} should be a subset of the set { M2} generated in the step 2).
The method for detecting a multi-task resource conflict is characterized in that, in the step 6), if { M1} in { M4} corresponds to a single event in { M1} sequence, an event sequence number, an event priority and an event time corresponding to the event should be recorded.
The method for detecting the multi-task resource conflict is characterized in that, in the step 6), if a certain event in the { M4} comprises a plurality of task components in the { M2}, the time and the priority of the tasks in the { M2} of the tasks are respectively recorded.
The method for detecting a multi-task resource conflict is characterized in that, in the step 6), the method for sorting the event period, the event priority and the event sequence number of { M1} comprises the following steps:
prioritizing the events by ordering them from high to low priority; events with the same priority are sorted according to event periods, sporadic events are sorted in the front, and events with shorter periods are sorted in the front; and sequencing the events with the same priority and consistent event periods according to the sequence of the sequence numbers.
The method for detecting the multi-task resource conflict is characterized in that the method for calculating the resource occupancy rate of each event in the { M1} in the { M4} in the step 7) comprises the following steps:
counting the time when a specific resource is called by events in all { M4} sequences and sum Σ T1 ═ T1+ T2+ T3+. ti, wherein T time is the task processing completion time in { M2 };
if a certain time point in { M4} includes a certain task or tasks in { M2}, the time when the specific resource of the event in { M4} is called and Σ T2 ═ T1+ T2+ T3+. ti, where T time is the task processing completion time in { M2 };
then the resource occupancy for that event is Σ T2/Σ T1. (ii) a
The method for detecting the multi-task resource conflict is characterized in that, in the step 7), whether the resource conflict exists or not is judged, and the method for judging the conflict event and task comprises the following steps:
if a certain specific resource is called by a plurality of tasks in the { M2} sequence, the { M2} tasks are subjected to time axis layout according to the { M1} sequence, the execution condition of the tasks is analyzed, and when the following conditions exist, the resource conflict is considered to exist:
if multiple { M2} sequence tasks of the calling resource are overlapped on a time axis, the overlapped tasks have tasks and the events containing the overlapped tasks have conflict.
The invention has the beneficial effects that:
1. the algorithm complexity is low, is linear and can support large-scale software time sequence analysis.
2. The algorithm is simple to implement, and the process can be deleted according to the application. Such as: if only the specific resources are required to be known whether the specific resources conflict or not, only the specific resources are analyzed; if only the specific time is required to be known whether the conflict exists, the events in a single time period and the tasks and the called resources contained in the events are analyzed.
3. Comprehensive detection data of the resource conflict interval can be obtained.
Drawings
FIG. 1 is a diagram of an event data model according to an embodiment of the present invention;
FIG. 2 is a diagram of a task data model according to an embodiment of the invention;
FIG. 3 is a diagram of a relational data model of events and tasks in accordance with an embodiment of the invention;
FIG. 4 is a diagram illustrating a task resource invocation scenario according to an embodiment of the present invention;
FIG. 5 is a diagram illustrating a task time period according to an embodiment of the invention.
Detailed Description
The invention provides a multi-task resource conflict detection method based on event flow analysis, which is used for comprehensively detecting the resource conflict condition of software, accurately analyzing each task use time period of the software according to the actual application scene of the software, accurately positioning software resource conflicts and prompting software testers according to the conflicted events and tasks.
The invention comprises the following steps:
1) the following data are given: event name and its trigger period and handling completion time; the occupied time of each task; the relationship of events and tasks;
2) the data structure model of the set of event time slices { M1}, { M1} is constructed according to the processing completion time of each event: mi1{ ti1, type, ci };
wherein: ti represents the time slice when the event occurs, type represents whether it is a periodic event, and when type is an accidental event, ci is 0.
3) Constructing a data structure model of a task running time set { M2}, { M2} as Mi2{ ti2, Tk2, Pk2} according to the task running time;
wherein: ti represents the task processing completion time, Tk represents the kth task, and Pk represents the priority of the task;
4) constructing a data structure model of a task call resource condition set { M3}, { M3} as Mi3{ Tk, type, address { addr1, addr2, addr3 … } } according to the task call resource condition;
wherein: tk is a task in the M1 sequence, type is a resource use type, and address is a space address 1 corresponding to the resource
5) The data structure model of an event-task relationship set { R1}, { R1} is Ri1{ Tk1, Ma2, Mb2, Mc2, … … } according to the relationship of tasks to be called in each event;
wherein: tk represents the kth event, Mk2 represents the task set model corresponding to { M2} for the Tk event;
6) and (3) sorting the tasks in the { M2} according to the relation of { R1} and by using the event period, the event priority and the event sequence number of { M1} to form a new set { M4} of task time slice sequences, wherein the data structure model of the set { M4} is as follows: mi3{ Mi1, Ma2, Mb2, Mc2, … … };
wherein Mk1 represents an event model corresponding to { M1} for the current event, Mk2 represents a task set model corresponding to { M2} and { M3} for the current event;
7) calculating the time period of each event in M1 in M4 for calling the resource, and the time period of each task in M2 for calling the resource;
on the basis of the above analysis, the following data were obtained:
maximum time occupied by each event for each resource;
the utilization rate of each resource when the software runs;
whether there are resource conflicts, and the events and tasks that are in conflict.
In the step 4), the TTK should correspond to a member in { M1 }.
In said step 5), TK1 should correspond to a member of { M1}, and { M2} should be a subset of the set { M2} generated in said step 2).
In the step 6), if a certain event in { M4} contains a plurality of task components of { M2}, the time and priority of the tasks in { M2} of these tasks are respectively recorded.
In step 6), the method for sorting the event cycle, the event priority and the event sequence number of { M1} includes:
prioritizing the events by ordering them from high to low priority; events with the same priority are sorted according to event periods, sporadic events are sorted in the front, and events with shorter periods are sorted in the front; and sequencing the events with the same priority and consistent event periods according to the sequence of the sequence numbers.
In the step 7), the method for calculating the occupancy rate of each event in the { M1} in the { M4} to the resource is as follows: counting the time when the specific resource is called by the event in all { M4} sequences and sum sigma T1 ═ T1+ T2+ T3+ … ti, wherein T time is the task processing completion time in { M2 };
if a certain time point in { M4} includes a certain task or tasks in { M2}, the sum of the time when the specific resource of the event in { M4} is called and Σ T2 ═ T1+ T2+ T3+ … ti, where T time is the task processing completion time in { M2 };
the resource occupancy rate of the event is Σ T2/Σ T1;
the method for judging whether the resource conflict exists in the step 7) and the conflict event and task includes the following steps:
if a certain specific resource is called by a plurality of tasks in the { M2} sequence, the { M2} tasks are subjected to time axis layout according to the { M1} sequence, the execution condition of the tasks is analyzed, and when the following conditions exist, the resource conflict is considered to exist:
if multiple { M2} sequence tasks of the calling resource are overlapped on a time axis, the overlapped tasks have tasks and the events containing the overlapped tasks have conflict.
The invention is further described with reference to the following detailed drawings
1) Building a data model
The event data model for software execution is shown in FIG. 1, where the lower the priority contract priority value, the higher the priority.
The software designed task data model is shown in FIG. 2, where the lower the priority contract priority value, the higher the priority.
The relational data model for events and tasks is shown in FIG. 3.
The task resource calling situation of the software design is shown in FIG. 4.
2) The construction of task time periods from event-task relationships is illustrated in fig. 5.
3) And sequencing according to the event priority, the event period and the event sequence number, and forming a time sequence diagram.
4) Detecting conflicts
According to the resource conflict detection rule, the following conclusions can be obtained:
resource a and resource B conflict: when the task A of the event 1 calls the resource A, the task C of the event 1 calls the resource B to generate conflict;
resource a and resource C conflict: when the task A of the event 1 calls the resource A, the task D of the event 2 calls the resource C to generate conflict;
resource B and resource C conflict situation: resource B does not have a conflict with resource C.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.

Claims (8)

1. A multi-task resource conflict detection method based on event stream analysis comprises the following steps:
1) the following data are given: event name and its trigger period and handling completion time; the occupied time of each task; the relationship of events and tasks;
2) constructing a set of event time slices { M ] according to the to-be-processed completion time of each event1}，{M1The data structure model of } is: mi 1{ti1，type，ci}；
Wherein: ti represents a time slice when an event occurs, type represents whether the event is a periodic event, and when the type is an accidental event, the ci value is 0;
3) constructing task running time set { M) according to task occupation time2}，{M2The data structure model of (1) is Mi 2{ti 2，Tk2，Pk2}；
Wherein: ti represents the task processing completion time, Tk represents the kth task, and Pk represents the priority of the task;
4) constructing a task calling resource condition set { M) according to task calling resource conditions3}，{M3The data structure model of (1) is Mi 3{Tk，type，address{addr1，addr2，addr3…}}；
Wherein: tk is M1For a task in the sequence, type is a resource use type, and address is a space address corresponding to the resource;
5) establishing a relation set of events and tasks according to the relation of tasks to be called in each event { R }1}，{R1The data structure model of Ri 1{Tk1，Ma 2，Mb 2，Mc 2，……}；
Wherein: tk denotes the kth event, Mk 2Indicates Tk event correspondence { M2The task set model of { C };
6) will { M2The tasks in { M } are according to the relation of { R1}, in1Event slice of { M })2The task priority and the task sequence number of the task are sequenced to form a set { M4} of a new task time slice sequence, and a data structure model of the set { M4} is as follows: mi 3{Mi 1，Ma 2，Mb 2，Mc 2，......}；
Wherein M isk 1Representing a current event correspondence { M1Event model of { M }, Mk 2Representing a current event correspondence { M2And { M }3A corresponding task set model;
7) calculating { M of { M4}1Time period of each event call to resource, { M } time period of each event call to resource2The time period for each task to call the resource;
on the basis of the above analysis, the following data were obtained:
maximum time occupied by each event for each resource;
the utilization rate of each resource when the software runs;
whether there are resource conflicts, and the events and tasks that are in conflict.
2. The method for detecting the multi-task resource conflict based on the event stream analysis of claim 1, wherein in the step 4), TK and { M }1The members in the } correspond.
3. The multitask resource conflict detection method according to claim 1, characterized in that in step 5), TK1And { M1Member in { M } corresponds to2The set { M } generated in the step 2) is2A subset of.
4. The method of claim 1, wherein the detecting of the multi-tasking resource conflict is performed at the time of the detecting of the multi-tasking resource conflictIn step 6), if { M }4{ M in }1Correspond to { M }1And recording the event sequence number, the event priority and the event time corresponding to the event in the single event in the sequence.
5. The method according to claim 1, wherein in step 6), if { M } is greater than M4An event in includes { M }2A plurality of tasks are formed, and M of the tasks are recorded respectively2Time and priority of tasks in the } table.
6. The method according to claim 1, wherein in step 6), the value is { M }1Event slice of { M })2The method for sequencing the task priority and the task sequence number comprises the following steps:
the priorities are sorted from high to low according to the task priorities;
tasks with the same priority are sorted according to the event sequence number, the task starting sequence and the task sequence number, wherein the sporadic events are sorted in the front, the tasks which start first are sorted in the front, and the events which start first are sorted in the front;
and the tasks have the same priority and consistent start time, and the events with consistent start time are sequenced according to the sequence of the sequence numbers.
7. The multitask resource conflict detection method according to claim 1, wherein { M } is calculated in the step 7)4In (M) }1The method for the occupancy rate of each event to the resource comprises the following steps:
statistics that a particular resource is owned by M4The sum of the times when the events in the sequence are called Σ T1 ═ T1+ T2+ T3+ … ti, where T is time { M }2Task processing completion time in the previous step;
if { M }4A certain point in time in includes { M }2Some task or tasks in { M }, then4The sum of the time at which the particular resource for that event in the } is called, Σ T2, T1+ T2+ T3+ … ti, where T time is { M2Task processing completion time in }；
Then the resource occupancy for that event is Σ T2/Σ T1.
8. The method for detecting multi-task resource conflict according to claim 1, wherein the step 7) is performed to determine whether there is resource conflict, and the conflicting events and tasks are determined by:
if a certain specific resource is called by a plurality of tasks in the { M2} sequence, performing time axis layout on the { M2} task according to the { M1} sequence, analyzing the task execution condition, and considering that the resource conflict exists when the following conditions exist: if multiple { M2} sequence tasks of the calling resource are overlapped on a time axis, the overlapped tasks have tasks and the events containing the overlapped tasks have conflict.
CN202111244730.2A 2021-10-25 2021-10-25 Multi-task resource conflict detection method based on event stream analysis Pending CN113886051A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111244730.2A CN113886051A (en) 2021-10-25 2021-10-25 Multi-task resource conflict detection method based on event stream analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111244730.2A CN113886051A (en) 2021-10-25 2021-10-25 Multi-task resource conflict detection method based on event stream analysis

Publications (1)

Publication Number Publication Date
CN113886051A true CN113886051A (en) 2022-01-04

Family

ID=79014200

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111244730.2A Pending CN113886051A (en) 2021-10-25 2021-10-25 Multi-task resource conflict detection method based on event stream analysis

Country Status (1)

Country Link
CN (1) CN113886051A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1797976A (en) * 2004-12-29 2006-07-05 华为技术有限公司 Method for transmitting data between main and standby boards
CN101035013A (en) * 2006-03-08 2007-09-12 中兴通讯股份有限公司 Resource receiving control method and system
CN103019811A (en) * 2012-10-19 2013-04-03 北京神舟航天软件技术有限公司 Segmental detection method for multi-task resource conflict
WO2017167105A1 (en) * 2016-03-31 2017-10-05 阿里巴巴集团控股有限公司 Task-resource scheduling method and device
CN112527671A (en) * 2020-12-18 2021-03-19 上海航天计算机技术研究所 Multi-task time sequence conflict detection method based on event stream analysis

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1797976A (en) * 2004-12-29 2006-07-05 华为技术有限公司 Method for transmitting data between main and standby boards
CN101035013A (en) * 2006-03-08 2007-09-12 中兴通讯股份有限公司 Resource receiving control method and system
CN103019811A (en) * 2012-10-19 2013-04-03 北京神舟航天软件技术有限公司 Segmental detection method for multi-task resource conflict
WO2017167105A1 (en) * 2016-03-31 2017-10-05 阿里巴巴集团控股有限公司 Task-resource scheduling method and device
CN112527671A (en) * 2020-12-18 2021-03-19 上海航天计算机技术研究所 Multi-task time sequence conflict detection method based on event stream analysis

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张婷;陈娟;卢岩;欧阳昭连;池慧;: "基于专利分析的组织工程热点子领域识别及技术开发实力评估", 中国组织工程研究, no. 24, 14 April 2020 (2020-04-14) *

Similar Documents

Publication Publication Date Title
CN110232024B (en) Software automation test framework and test method
CN112527671B (en) Event stream analysis-based multi-task time sequence conflict detection method
CN110825522A (en) Spark parameter self-adaptive optimization method and system
Chen et al. Analysis of deadline miss rates for uniprocessor fixed-priority scheduling
CN113282402B (en) Test task scheduling method oriented to complex resource constraint
Tobuschat et al. System-level timing feasibility test for cyber-physical automotive systems
CN108089982A (en) Test method, device, electronic equipment and computer readable storage medium
Lin et al. Analysis and assessment of software reliability modeling with preemptive priority queueing policy
CN114676066A (en) Security testing method and device for target application, electronic equipment and storage medium
Paredis et al. Translating process interaction world view models to DEVS: GPSS to (Python (P)) DEVS
CN113886051A (en) Multi-task resource conflict detection method based on event stream analysis
Kranzlmüller et al. NOPE: A nondeterministic program evaluator
CN112181811B (en) Application stability testing method
Acharya et al. Model based test case prioritization for testing component dependency in cbsd using uml sequence diagram
Andersson et al. Extracting simulation models from complex embedded real-time systems
Sthamer et al. Evolutionary testing of embedded systems
CN113806231A (en) Code coverage rate analysis method, device, equipment and medium
CN110046809B (en) Job scheduling method and device
Ostrand et al. Predicting bugs in large industrial software systems
CN117195568B (en) Simulation engine performance analysis method and device based on discrete event
Fang et al. Test Selection with Equivalence Class Partitioning
CN111352852A (en) Regression test case selection method and device
Chen et al. Dawn of the Dead (line Misses): Impact of Job Dismiss on the Deadline Miss Rate
CN112650687B (en) Method, device, equipment and medium for testing execution priority of engine scheduling action
CN113590300B (en) Timed task execution method and device, storage medium and equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination