A Method for Construction of Software Protection Technology Application Sequence Based on Petri Net With Inhibitor Arcs | Zendy

Qing Su | Zendy; Fan He | Zendy; Naiqi Wu | Zendy; Zhiyi Lin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Method for Construction of Software Protection Technology Application Sequence Based on Petri Net With Inhibitor Arcs

Author(s) -

Qing Su,

Fan He,

Naiqi Wu,

Zhiyi Lin

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2812764

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

In the field of software protection, when there is a dependence between the various software protection technologies, the application order of these technologies must be arranged in a correct way in order to maximize the protection effect. When applying these technologies in a random way as the traditional methods do, an unexpected consequence may be produced, such as weakening the software protection effect and causing the protected software malfunction. To solve this problem, in this paper, a Petri net model is developed to describe the dependence behavior of applying multiple protection technologies. Then, algorithm is proposed to generate the reachable marking graph for the obtained Petri model. In considering different user requirements, based on the reachable marking graph, a method is presented to obtain a user-required and correct sequence of applying multiple protection technologies. The correctness of the obtained sequence is verified by a finite state automaton model. Experimental results show that the proposed method outperforms the traditional ones.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research