Computer Science

Computer Science ›› 2023, Vol. 50 ›› Issue (11A): 221000118-12.doi: 10.11896/jsjkx.221000118

• Big Data & Data Science • Previous Articles     Next Articles

Compliance Check Method for Data Flow Process Based on Extended Reachability Graph withLabeled Timing Constraint Petri Net

LIU Zhenyu, DONG Hui, LI Hua, WANG Lu   

  1. College of Computer Science,Inner Mongolia University,Hohhot 010021,China
  • Published:2023-11-09
  • About author:LIU Zhenyu,born in 1987,Ph.D candidates.His main research interests include formal methods and software test.

    LI Hua,born in 1964,Ph.D,professor,Ph.D supervisor,is a member of China Computer Federation.Her main research interests include integration of network and cloud computing,big data analysis and evaluation methods,software service computing and testing.
  • Supported by:
    National Natural Science Foundation of China(61862047,62066034) and Inner Mongolia Science & Technology Plan(201802028,2020GG0186).

PDF (PC)

436

Abstract: With the continuous improvement of social system and laws and regulations,the business management process of enterprise is facing more and more requirements of compliance check.The labeled timing constraint Petri net(LTCPN) model is used to describe the laws,regulations and industry rules followed in the process of data flow.In order to support the rule expression of more dimensions,firstly,it is necessary to construct extended reachability graph GNR based on LTCPN reachability graph,and then automatically generate actual data flow model GNP according to the timestamp event log trace.By examining whether GNP|＝GNR to determine that the data flow process based on the event log of timestep is conform to the rule specification described by LTCPN.For the problem of process model compliance check with unknown semantic information,same connection structure of node and edge can be used to detect the functional attribute compliance of semantically independent event.In terms of process models for explicit semantic information,the semantic information of nodes or edges can effectively reduce the number of state spaces explored in checking process,and further enrich the non-functional attribute check of compliance check.The feasibility of method in compliance check is verified by experiments.

Key words: Petri net, Time-labeled, Reachability graph, Graph isomorphism, Compliance check

CLC Number: 

  • TP311
[1]SOX.Sarbanes-Oxley Act[EB/OL]https://www.soxlaw.com/.
[2]Basel Committee on Banking Supervision Basel III[M].ChinaFinancial Publishing House,2014.
[3]General Data Protection Regulation[EB/OL].https://gdpr.eu/.
[4]Network Security Law of the People’s Republic of China[EB/OL].[2017-02-20].http://www.npc.gov.cn/wxzl/gongbao/2017-02/20/content_2007531.htm.
[5]Civil Code of the People’s Republic of China[EB/OL].[2020-06-02].http://www.npc.gov.cn/npc/c30834/202006/75ba6483b8344591abd07917e1d25cc8.shtml.
[6]Data Security Law of the People’s Republic of China[M].Law Press,2021.
[7]Personal Information Protection Law of the People’s Republicof China[EB/OL].[2021-08-20].http://www.npc.gov.cn/npc/c30834/202108/a8c4e3672c74491a80b53a172bb753fe.shtml.
[8]VAN DER AALST W.Process Mining:Discovery,Conformance and Enhancement of Business Processes[M].Berlin Heidelberg:Springer-Verlag,2011.
[9]VAN DER AALST W.Process mining[M].Tsinghua University Press,2014.
[10]RAMEZANI T E,FAHLAND D,AALST V D W M.Where did I misbehave? Diagnostic information in compliance checking[J].Lecture Notes in Computer Science,2012,7481:262-278.
[11]GHEZZI C,GUINEA S.Run-time monitoring in service-orien-ted architectures[M].Heidelberg:Springer Berlin,2007:237-264.
[12]EL GAMMAL A F S A.Towards a comprehensive framework for business process compliance[D].Tilburg University,School of Economics and Management,2012.
[13]WU Z H.Introduction to Petri Nets[M].China Machine Press,2006.
[14]PETRI C A.Kommunikation mit Automaten(Communication with Automata)[D].University of Bonn,1962.
[15]LI H,ZHAO Y L,ZHOU Y L.Time Petri-net models of timeralated system[J].Journal of Inner Mongolia University(Natural Science Edition),2000,31(1):125-131.
[16]LIU B.Software Verification and Validation[M].National Defense Industry Press,2011.
[17]TSAI J J P,JENNHWA Y S,CHANG Y.Timing constraint Petri nets and their application to schedulability analysis of real-time system specifications[J].IEEE Transactions on Software Engineering,1995,21(1):32-49.
[18]SONG W,DOU W C,LIU X P.Time Constrained Petri Nets and Its Schedulability Analysis and Verification[J].Journal of Software,2007(1):11-21.
[19]LIU X M,LI S X,LI W J,et al.A Time Petri Net with Extended Price Information[J].Journal of Software,2007,18(1):1-10.
[20]BONHOMME P.A symbolic schedulability technique of real-time systems modeled by P-Time Petri nets[C]//IEEE.2011:582-587.
[21]BONHOMME P,BERTHELOT G,AYGALINC P,et al.Verification Technique for Time Petri Nets[C]//2004 IEEE International Conference on Systems,Man and Cybernetics(IEEE Cat.No.04CH37583).2004:4278-4283.
[22]BONHOMME P,HOVSEPIAN A.Towards a new schedulability technique of real-time systems based on difference of constraints system[C]//IEEE.2012.599-604.
[23]ZHOU J T,YE X M.Comparison between reachable graph and reachable tree of Petri nets[J].Journal of Inner Mongolia University(Natural Science Edition),2000(1):117-120.
[24]ZHOU J T,YE X M.A Method for Constructing Reachability Graphs of Petri Nets[J].Journal of Inner Mongolia University(Natural Science Edition),1999(3):127-130.
[25]BOUCHENEB H,BERTHELOT G.Towards a simplified buil-ding of time Petri Nets reachability graph[C]//Proceedings of 5th International Workshop on Petri Nets and Performance Models.1993:46-47.
[26]ISO/IEC 15909-1-2019,Systems and software engineering-High-level Petri nets-Part 1:Concepts,definitions and graphical notation(Second edition)[S].ISO/IEC,2019.
[27]ZHANG Y R,LI H,XING Y,et al.Test case generation combi-ning CPN modeling and on the fly method[J].Journal of Software,2017,28(10):2564-2582.
[28]CPN Tools(Version 4.0)[EB/OL].http://cpntools.org/.
[29]ROSEN K H.Discrete Mathematics and Its Applications(the7th edition of the original book)[M].China Machine Press,2015.
[30]CORDELLA L P,FOGGIA P,SANSONE C,et al.A(sub)graph isomorphism algorithm for matching large graphs[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2004,26(10):1367-1372.
[31]CARLETTI V,FOGGIA P,SAGGESE A,et al.Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2018,40(4):804-818.
[32]AALST V D W M.Decomposing Petri nets for process mining:a generic approach[J].Distributed and Parallel Databases:an International Journal,2013,31(4):471-507.
[33]TANG C J,CHEN P,XIANG Y,et al Introduction to Computational Theory(2nd Edition)[M].China Machine Press,2006.
[34]WANG J,ZHAN N J,FENG X Y,et al.Overview of formalmethods[J].Journal of Software,2019,30(1):33-61.
[35]AALST W,BEER H,DONGEN B.Process Mining and Verification of Properties:An Approach Based on Temporal Logic[C]//On the Move to Meaningful Internet Systems 2005:CoopIS,DOA,and ODBASE pt.1.Lecture Notes in Computer Science.2005.
[36]MONTALI M,PESIC M,AALST W M P V,et al.Declarative specification and verification of service choreographiess[J].ACM Transactions on the Web,2010,4(1):1-62.
[37]RAMEZANI T E,FAHLAND D,AALST V D W M.Diagnostic information in compliance checking[R].BPM Center Report BPM-12-11,BPMcenter.org,2012.
[38]VAN DER AALST W M P,PESIC M,SONG M.BeyondProcess Mining:From the Past to Present and Future[C]//CAiSE 2010:Advanced Information Systems Engineering.2010:38-52.
[39]VAN DER AALST W M P,SCHONENBERG M H,SONG M.Time prediction based on process mining[J].Information Systems,2011,36(2):450-475.
[40]HAN D,TIAN Y H,DU Y Y,et al.Service alignment method based on Petri net reachability graph[J].Computer Integrated Manufacturing Systems,2020,26(6):1589-1606.
[41]ADRIANSYAH A,VAN DONGEN B F,VAN DER AALST W M P.Cost-Based Conformance Checking using the A* Algorithm[R].Technical Report,BPM Center Report BPM-11-11,BPMcenter.org,2011.
[42]WANG Y Q,WEN L J,YAN Z Q.Alignment based confor-mance checking algorithm for BPMN 2.0 model[J].Journal of Computer Research and Development,2017,54(9):1920-1930.
[43]VAN DER AALST W,ADRIANSYAH A,VAN DONGEN B.Replaying history on process models for conformance checking and performance analysis[J].WIREs Data Mining and Know-ledge Discovery,2012,2(2):182-192.
[44]AGOSTINELLI S,MAGGI F M,MARRELLA A,et al.Achieving GDPR Compliance of BPMN Process Models[M].Cham:Springer International Publishing,2019:10-22.
[45]CAPODIECI A,MAINETTI L.A Structured Approach to GDPR Compliance[M].Digital Transformation of Collaboration,2020.
[46]YANG L Q,KANG G S,CAI W G,et al.Research on Business Process Mining Algorithm[J].Computer Applications and Software,2016,33(4):44-50.
[1] YAO Xi, CHEN Yande. Path Planning of Hydrographic Mapping UAV Based on Multi-constraint Petri Net [J]. Computer Science, 2023, 50(6A): 220700079-7.
[2] LI Qing, LIU Wei, GUAN Meng-zhen, DU Yu-yue, SUN Hong-wei. Modeling and Analysis of Emergency Decision Making Based on Logical Probability GamePetri Net [J]. Computer Science, 2022, 49(4): 294-301.
[3] TAO Xiao-yan, YAN Chun-gang, LIU Guan-jun. Dynamic Data Refining Strategy for Soundness Verification Based on WFT-net [J]. Computer Science, 2021, 48(7): 99-104.
[4] LAI Xiang-wei, ZHENG Wan-bo, WU Yan-qing, XIA Yun-ni, RAN Qi-hua, DONG Yin-huan. Task Collaborative Process Network Model and Time Analysis of Mine Accident Emergency Rescue Digital Plan [J]. Computer Science, 2021, 48(6A): 596-602.
[5] NING Yu-hui, YAO Xi. Design and Implementation of Emergency Command System [J]. Computer Science, 2021, 48(6A): 613-618.
[6] ZHAN Wan-li, HU Jun, GU Qing-fan, RONG Hao, QI Jian, DONG Yan-hong. Model-based Fault Tree Automatic Generation Method [J]. Computer Science, 2021, 48(12): 159-169.
[7] WANG Wu-song, FANG Huan, ZHENG Xue-wen. Process Variants Merging Method Based on Group-fair Control Flow Structure [J]. Computer Science, 2021, 48(12): 170-180.
[8] YANG Hao-ran, FANG Xian-wen. Business Process Consistency Analysis of Petri Net Based on Probability and Time Factor [J]. Computer Science, 2020, 47(5): 59-63.
[9] SUN Shu-ya, FANG Huan, FANG Xian-wen. Log-induced Morphological Fragments Process Clustering Method [J]. Computer Science, 2019, 46(8): 71-77.
[10] SU Qing,LIN Hao,HUANG Jian-feng,HE Fan,LIN Zhi-yi. Study on Dynamic-graph Watermarking Based on Petri Net Coding [J]. Computer Science, 2019, 46(7): 120-125.
[11] SONG Jian,FANG Xian-wen,WANG Li-li. Process Model Mining Method Based on Process Cut [J]. Computer Science, 2019, 46(7): 315-321.
[12] XIANG Ying-zhuo, WEI Qiang, YOU Ling, SHI Hao. Improved Genetic Algorithm for Subgraph Isomorphism Problem [J]. Computer Science, 2019, 46(6A): 98-101.
[13] SONG Jian, FANG Xian-wen, WANG Li-li, LIU Xiang-wei. Method of Mining Hidden Transition of Business Process Based on Behavior Profiles [J]. Computer Science, 2019, 46(12): 334-340.
[14] JIANG Shun-liang, GE Yun, TANG Yi-ling XU, Shao-ping, YE Fa-mao. Node Invariants by Imitating High-order Moments and Their Graph Invariants [J]. Computer Science, 2018, 45(8): 300-305.
[15] CAO Rui, FANG Xian-wen, WANG Li-li. Method of Mining Conditional Infrequent Behavior Based on Communication Behavior Profile [J]. Computer Science, 2018, 45(8): 310-314.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.