Computation of an emptiable minimal siphon in a subclass of Petri nets using mixed-integer programming

Wang, Shouguang; Duo, Wenli; Guo, Xin; Jiang, Xiaoning; You, Dan; Barkaoui, Kamel; Zhou, MengChu

doi:10.1109/jas.2020.1003210

Cited by 22 publications

(6 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Petri net and its extended models, such as stochastic timed Petri net, generalized connected self-loop free Petri net (S 4 PR), logic and threshold Petri net, Petri net with data operations, etc., are widely used in the modeling and analysis of discrete event scenarios. These models have been applied to the development of simulation engines for resource optimal provisioning analysis in emergency healthcare systems [18], the calculation of emptiable minimal siphon [40], the design of web service discovery strategy based on user requirements [41], and data-flow error detection in business processes [42]. Ding et al [43] proposed a systematic strategy with specific algorithms to construct an interactive control model based on Petri net for human-computer interaction systems to analyze and control mobile robots.…”

Section: Resultsmentioning

confidence: 99%

CTFTP: A Test Case Generation Strategy for General Boolean Expressions Based on Ordered Binary Label-Driven Petri Nets

Gong

2020

IEEE Access

View full text Add to dashboard Cite

Boolean expression testing requires certain types of tests for each Boolean expression in program specification or implementation. Fault-based testing essentially uses a subset of the exhaustive test set to detect certain special types of faults. A fault-based Boolean expression testing strategy called constraint true and false test point (CTFTP) is proposed. The test consists of two test case generation strategies, namely a unique constraint true point (UCTP) strategy and a near constraint false point (NCFP) strategy. An ordered binary label-driven Petri net model is presented to analyze the interaction between Boolean transitions and Boolean literals and yield the test paths of a singular term for the irredundant disjunctive normal forms (IDNFs). On the basis of the test paths, we develop a configuration-based IDNF test generation algorithm, which is employed to obtain the UCTP, NCFP, and CTFTP test sets for the IDNFs. The proposed test generation algorithm based on literal substitution is applied to extend the CTFTP strategy and generate a test suite for general Boolean expressions, which are evaluated using TCAS II specifications. Experimental results show that the CTFTP strategy can detect the same seven types of faults similar to the MUMCUT strategy when testing IDNFs, but only a subset of the MUMCUT test set is required. Five types of faults of general Boolean expressions can also be detected using CTFTP strategies. INDEX TERMS Automatic test cases generation, fault-based testing, general Boolean expression test, ordered binary label-driven Petri net, path-oriented test criteria.

show abstract

Section: Resultsmentioning

confidence: 99%

CTFTP: A Test Case Generation Strategy for General Boolean Expressions Based on Ordered Binary Label-Driven Petri Nets

Gong

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Ever since its inception in 1962, Petri Nets have been used for modeling of discrete event systems. Petri net is still an active research area; research papers on newer applications (e.g., [41], [42]), and the analysis (e.g., [43]- [45]) continue to appear. However, its huge size, and its state-space, and the slow execution (and simulation) prevents its use for modern large real-life applications, e.g., Industry 4.0.…”

Section: Discussionmentioning

confidence: 99%

Extracting Petri Modules From Large and Legacy Petri Net Models

Davidrajuh

2020

IEEE Access

View full text Add to dashboard Cite

Petri nets, even though very useful for modeling of discrete event systems, suffer from some weaknesses such as huge size, huge state space, and slow in simulation. Due to the huge state space, model checking a Petri net is difficult. Also, due to the slowness in simulation, discrete-timed Petri nets cannot be used for real-time applications. Thus, modular Petri nets are suggested as a way of overcoming these difficulties. In modular Petri nets, modules are designed, developed, and run independently, and the modules communicate with each other via inter-modular connectors. This approach is suggested for developing newer Petri net models. However, there exists a large number of Petri net models of real-life systems, and these legacy models are enormous and non-modular. And, these models cannot be discarded as large amounts of time and money were spent to develop these models. This paper presents a unique algorithm for extracting modules from large and legacy Petri net models. The algorithm extracts modules (known as "Petri modules") that are well-defined for inter-modular collaboration. Also, the extraction method preserves the structural properties. The goal of the paper is to introduce a methodology by which Petri nets can be moved to a new level in which a modular Petri net model can be made of Petri modules. The Petri modules are independent and can be hosted on different computers. These modules communicate via inter-modular components such as TCP/IP sockets. Since Petri modules are compact, also run faster, thus become suitable for supervisory control of real-time systems.

show abstract

“…The supervisory control always designs a Petri net supervisor to satisfy the required control specifications [22,23,36,38,41]. Here, we use control places to enforce an LPN to be currentstate opaque.…”

Section: Introductionmentioning

confidence: 99%

A symbolic approach to the verification and enforcement of current‐state opacity using labelled Petri nets

Peng,

Chen,

2023

IET Control Theory & Appl

View full text Add to dashboard Cite

This work proposes a symbolic method to verify and enforce the current‐state opacity of labelled Petri nets (LPNs). The notion of basis markings of partially observed Petri nets currently dominates the development of opacity verification and enforcement for discrete event systems. However, the related computational efficiency, to a great extent, depends on the number of basis markings in a system, which increases exponentially with respect to the size of its corresponding LPN model. Binary decision diagrams (BDDs) are capable of computing a set of basis markings in a compact shared structure. To mitigate the computational overheads, a BDD‐based method to efficiently model the structure and behaviour of an LPN is proposed. Then, the current‐state opacity of LPNs is verified and enforced in a symbolic manner. Finally, a number of examples are provided to demonstrate the effectiveness and efficiency of the proposed method.

show abstract

Computation of an emptiable minimal siphon in a subclass of Petri nets using mixed-integer programming

Cited by 22 publications

References 52 publications

CTFTP: A Test Case Generation Strategy for General Boolean Expressions Based on Ordered Binary Label-Driven Petri Nets

CTFTP: A Test Case Generation Strategy for General Boolean Expressions Based on Ordered Binary Label-Driven Petri Nets

Extracting Petri Modules From Large and Legacy Petri Net Models

A symbolic approach to the verification and enforcement of current‐state opacity using labelled Petri nets

Contact Info

Product

Resources

About