On-line verification of current-state opacity by Petri nets and integer linear programming

Cong, Xuya; Fanti, Maria Pia; Mangini, Agostino Marcello; Li, Zhiwu

doi:10.1016/j.automatica.2018.04.021

Cited by 67 publications

(31 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tokens are placed in places and tokens represent the things that will flow through the system. [20][21][22][23][24][25][82][83][84] graphically represented by a bipartite graph, where P and T are finite sets of places and transitions, respectively. P [ T 6 ¼ ; and P \ T = ;.…”

Section: Petri Netsmentioning

confidence: 99%

“…For example, Petri nets have found extensive applications to industrial systems such as deadlock analysis and solution, [8][9][10] supervisory control, [11][12][13][14] implementation 15 and scheduling, [16][17][18][19] and fault analysis. [20][21][22][23] As an important mathematical tool of discrete event systems, 24,25 Petri nets are found to be the most suitable language to do such analyses due to the availability of many existing analysis tools. However, a mapping between BPMN and Petri nets can be defined for semantic analysis in order to check the correctness of a BPMN model.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Transformation of Business Process Model and Notation models onto Petri nets and their analysis

Mutarraf

Barkaoui

et al. 2018

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

Business Process Model and Notation is known as a widely used standard for business processes modeling. However, its main drawback is that it lacks formal semantics, leading to some undesirable properties, such as livelocks and deadlocks, such that it creates models with semantic errors. In order to formally verify them, we need to transform it onto a formal language, for example, Petri nets. The approach proposed in this article is an extension of previous approaches stated in the literature by adding probability to gateways and time to transitions. The first aim is to transform the Business Process Model and Notation process diagram onto Petri nets automatically using a developed software package. The developed software package is capable of transforming the XML file of a Business Process Model and Notation process diagram into ''m'' files of a Petri net. The ''m'' files of the Petri net are then coupled with the General Purpose Petri Net Simulator (GPenSIM) for analysis in MATLAB. The second aim is to manually transform the Business Process Model and Notation process diagram using mapping figures onto Petri nets and then analyze it using Timed Petri Net Analyzer tools. The advantage of transforming a Business Process Model and Notation diagram automatically is that we can add time to transitions and probability to gateways. Furthermore, the simulation time can be checked using MATLAB.

show abstract

Section: Petri Netsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Transformation of Business Process Model and Notation models onto Petri nets and their analysis

Mutarraf

Barkaoui

et al. 2018

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Automata are intuitive models used to achieve the original contributions and most of the subsequent developments in the literature of supervisory control of DESs [20], [50]. Meanwhile, with the development of DESs, Petri nets (PNs) have become a conceptual framework and a fundamental model for DESs since they are widely used to address various classes of problems, including the formal representation and development of systems, along with their supervisory control [9], [10], [17], [49], [55], controller synthesis or design [22], [23], [34], [47], state estimation and observability [2], [14], [36], fault detection, diagnosis, and prognosis [11], [16], [19], [25], [37], [48], [56], [57], diagnosability [3], [8], [40], [41], opacity [12], [13], [46],…”

Section: Introductionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper develops an approach for solving the problem of least-cost transition firing sequences estimation in labeled Petri nets with unobservable transitions. Each transition in the net is labeled as either observable or unobservable, and has a nonnegative cost. Additionally, we assume that the net system is bounded, the unobservable subnet is acyclic, and the cost of each unobservable transition is strictly positive. We propose the method mainly on the basis of the notions of basis marking and basis reachability graph (BRG), which is a compact representation of the reachability graph of the net system. By sacrificing extra storage space to keep the BRG and other necessary information in memory, some time-consuming computations are moved off-line. This makes our proposed approach more feasible for on-line applications. Finally, we present a brief survey and comparison of some representative methods that use labeled Petri nets as a formalism in the literature. INDEX TERMS Basis reachability graph (BRG), discrete event system (DES), Petri net (PN), transition firing sequence.

show abstract

“…Petri nets, a formal modeling tool invented by CA Petri, 1 have been applied to many fields, such as control of discrete event systems, [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] system reliability analysis, [18][19][20][21][22][23] modeling, analysis, control, [24][25][26][27][28][29][30][31][32][33] and the verification of communication protocol. 34 In the analysis of Petri nets, state-space techniques are used in marking reachability, forbidden states including deadlock control, [35][36][37] opacity verification and enforcement, and fault diagnosis.…”

Section: Introductionmentioning

confidence: 99%

On state-space compression and state reachability retrieval of Petri nets

Ren

Liang

et al. 2019

Advances in Mechanical Engineering

View full text Add to dashboard Cite

The problem of state-space explosion and state reachability decision has been a focus in Petri net analysis. In this article, some algorithms based on data features of state space are proposed for state-space reduction and reachability analysis in Petri nets. A caching arrangement algorithm for the state reachability graph is proposed to alleviate the memory overhead when all states are generated by a traditional reachability graph generation algorithm. For the reduction of the state space, a compression algorithm based on a hybrid coding is formulated. The changing characteristics of state elements are fully utilized to realize a sharp reduction of the whole state space. For the state reachability analysis, a state reachability retrieval algorithm based on the locally sensitive hashing is reported. In this algorithm, all the states in the compressed state space are distributed to different hash buckets according to the distances among the states, which realize the primary state retrieval efficiently. Then, a state retrieval strategy that reverts the primary retrieved state to its original data is adopted. Finally, the proposed compression and retrieval algorithms are validated on several Petri net models, showing high compression efficiency and exact accuracy of state retrieval.

show abstract

On-line verification of current-state opacity by Petri nets and integer linear programming

Cited by 67 publications

References 20 publications

Transformation of Business Process Model and Notation models onto Petri nets and their analysis

Transformation of Business Process Model and Notation models onto Petri nets and their analysis

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

On state-space compression and state reachability retrieval of Petri nets

Contact Info

Product

Resources

About