English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Parallel test task scheduling scheme has been an unsolved problem in automatic test system. The time Petri net model for parallel testing is established based on the theory of Petri net, the time Petri net-based parallel testing task modeling method is proposed, which combines the resource conflict problem caused by multi-task parallel scheduling in UML parallel testing system; The parallel task scheduling sequence with the shortest time required to complete all test tasks is obtained comparing the completion time of different sequences; Finally, an example is simulated and analyzed under this model; The experimental results show that the model is suitable for describing the task scheduling process of this type of system. Published by CSP © 2018 the Authors 338 The constrained transition enabling process based on forbidden arc is adopted. The input form of the set of libraries of constrained transition t is * { | } in i i P p p t = ∈ , and * 1 { | } k k P p p t = ∈ , * 2 { | } j j P p p t = ∈ are assumed. Among them, 1 P is set by the input library, and it does not contain forbidden arcs. Correspondingly, 2 P is set by the input library, and it contains forbidden arcs. It can be obtained based on the above definition: 1 2 in P P P = ∪ 。 ( , ) j b p t w denotes the prohibited arc weight between repository j p and constraint transition t . ( , ) j b p t denotes the forbidden arc between repository j p and constraint transition t . The weight of forward connection is larger than that of forward connection if for any ( ) i m p , and the weight of prohibited arc connection with constrained transition t is larger than that of identification number j p , then the constrained transition state t is in the state of transition enablement, otherwise the constrained transition state t is in the state of transition disability.

Research on On-line Testing of Real-time Software Based on Time Petri Network Model