A simulation engine for stochastic timed petri nets and application to emergency healthcare systems

Zhou, Jianchang; Wang, Jiacun; Wang, Jun

doi:10.1109/jas.2019.1911576

Cited by 64 publications

(30 citation statements)

References 17 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%

“…A Petri net consists of places, transitions, and arcs that connect places and transitions [18]. In this study, the basic…”

Section: A Definition Of Obldpnmentioning

confidence: 99%

“…Petri nets are a promising tool for describing and studying systems that are characterized as concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic [18]. Gong and Huang [19] proposed a generalized Boolean operator (BOR)-MI strategy based on predicate driven Petri nets to generate test cases for general Boolean expressions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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%

“…A Petri net consists of places, transitions, and arcs that connect places and transitions [18]. In this study, the basic…”

Section: A Definition Of Obldpnmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Petri nets are one of the typical mathematical models of DESs. The distributed nature and structural properties of Petri nets play an important role in solving various problems of DESs, including supervisory control [3]- [8], performance optimization [9]- [13], and big data [14]- [17]. In this paper, we address the fault diagnosis issue of a class of Petri nets.…”

Section: Introduction a Backgroundmentioning

confidence: 99%

Fault Diagnosis of Backward Conflict-Free Petri Nets by Generalized Markings

Wang

Zhu

2020

IEEE Access

View full text Add to dashboard Cite

This paper addresses the fault diagnosis problem in discrete event systems using backward conflict-free Petri nets, where two different transitions have no common output places. The notion of generalized markings is employed, where the number of tokens in a place can be negative. Based on the special structures of backward conflict-free Petri nets and the generalized marking corresponding to an observed transition sequence, an integer linear programming (ILP) problem is constructed where the numbers of unknown integer variables and constraints are independent of the length of the observed transition sequence. A diagnosis algorithm is proposed by associating two different objective functions with the ILP problem and solving it. The computational efficiency of the proposed algorithm depends on the net structure only, regardless of the length of an observed transition sequence. INDEX TERMS Fault diagnosis, Petri net, backward conflict-free net, generalized marking.

show abstract

“…They define colors of transitions, and associate both transitions and places with time. In addition, under uncertain environment, TPNs can be extended to associate transitions with stochastic transition firing times [12].…”

Section: Introductionmentioning

confidence: 99%

Modeling and Scheduling Methods for Batch Production Systems Based on Petri Nets and Heuristic Search

et al. 2020

View full text Add to dashboard Cite

An approach is proposed for modeling and scheduling batch production systems based on Petri nets. First, a group of jobs to be carried out by a batch production system is modeled by a transitiontimed Petri net according to logical relations between operations and time requirements on operations. Second, conflict relations between operations are obtained by operation-resource diagrams that describe how operations compete for resources, and are formally expressed by linear constraints. Third, monitor places are designed to enforce linear constraints on the transition-timed Petri net, and a plant net is consequently built and made free of conflicts between operations, which can well emulate a real batch production system. Fourth, an optimal schedule problem, where the optimization performance index is to minimize a makespan, is formalized based on a plant net. Finally, a new variant of filtered beam search method is proposed to solve the problem based on an ad hoc function and a dynamical timed extended reachability graph of a plant net. A typical chemical production plant illustrates the theoretic results.

show abstract

A simulation engine for stochastic timed petri nets and application to emergency healthcare systems

Cited by 64 publications

References 17 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

Fault Diagnosis of Backward Conflict-Free Petri Nets by Generalized Markings

Modeling and Scheduling Methods for Batch Production Systems Based on Petri Nets and Heuristic Search

Contact Info

Product

Resources

About