Autonomous tracking of chemical plumes developed in both diffusive and turbulent airflow environments using Petri nets

Yuan, Jie; Oswald, David; Li, Wei

doi:10.1016/j.eswa.2014.08.005

Cited by 17 publications

(8 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following data were calculated: the relative-to-best threshold (RBT), positive observations threshold (POT), and dependency threshold (DT) using Eqs. (6) and (7). The results of RBT, POT and DT were 0.833, 4, and 0.782 respectively.…”

Section: Iv5 Mining Using Heuristics Miner For Time Intervalsmentioning

confidence: 89%

“…Then the following data have been calculated: the relative-to-best threshold (RBT), positive observations threshold (POT), and dependency threshold (DT) using Eqs. (6) and 7.…”

Section: Iv3 Mining Using the Original Heuristics Minermentioning

confidence: 99%

“…Recently Process Mining has been implemented in many fields, such as business [4], environment [5], [6], smartphone [7], and fraud [8], [9]. Each method has its own disadvantages resulting in the activities of the organization not being represented effectively in the discovered model [10].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modified Time-Based Heuristics Miner for Parallel Business Processes

Sarno

Effendi

Haryadita

2016

IRECOS

View full text Add to dashboard Cite

Process Mining, or Process Discovery, is a method for modeling the workflow of a business process from event logs. Business process models contain sequential and parallel traces. In this paper, a modification of the frequently used process-mining algorithm Heuristics Miner is proposed. The proposed algorithm is called Modified Time-based Heuristics Miner because it considers not only the sequence of activities but also the time-based information from the event log. It can effectively distinguish parallel (AND), single choice (XOR) and conditional (OR) patterns; the latter cannot be discovered by the original Heuristics Miner. The threshold intervals are determined on the basis of the average dependency measure in the dependency graph. The experimental results show that the proposed algorithm is able to discover concurrent business processes formed by parallel (AND) and conditional (OR) patterns, whereas the existing Heuristics Miner algorithm can only discover concurrent business processes formed by parallel (AND) patterns. This paper also provides an evaluation of validity and fitness of the discovered process model.

show abstract

Section: Iv5 Mining Using Heuristics Miner For Time Intervalsmentioning

confidence: 89%

“…Then the following data have been calculated: the relative-to-best threshold (RBT), positive observations threshold (POT), and dependency threshold (DT) using Eqs. (6) and 7.…”

Section: Iv3 Mining Using the Original Heuristics Minermentioning

confidence: 99%

See 1 more Smart Citation

Modified Time-Based Heuristics Miner for Parallel Business Processes

Sarno

Effendi

Haryadita

2016

IRECOS

View full text Add to dashboard Cite

show abstract

“…The fuzzy Petri net (FPN), a kind of backward extension high-level Petri net (HLPN), has been widely applied to model and analyse uncertainty systems or knowledge-based systems (KBSs) [1]. Due to two unique features of FPN-structural store representation for fuzzy information and visualization description for uncertainty reasoning, FPN has been widely applied in various industrial areas, such as robotics [2,3], intelligent manufacturing systems [4,5], traffic control [6,7], semantic network [8,9], etc.…”

Section: Introductionmentioning

confidence: 99%

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

Zhou

Ding

et al. 2018

Symmetry

View full text Add to dashboard Cite

Fuzzy Petri net (FPN) is widely used to repre sent, model and analyse knowledge-based systems (KBSs). Meanwhile, a reachability tree is an important tool to fully represent the flow relationship of FPN and is widely applied to implement inference in industrial areas. However, the traditional reachability ignores recording the dependence relationships (‘and/or’ relationship) among the places in the neighbouring layers. This paper develops a modified reachability tree based on an and/or graph and presents a three-phase generation algorithm to model the reachability tree for the corresponding FPN automatically via fuzzy production rules (FPRs). Four cases are used to verify the correctness and feasibility of the proposed algorithm from different viewpoints, such as general FPRs, FPRs with a condition-sharing situation, FPRs with a conclusion-sharing situation, and FPRs with multi-conclusions. Simulation results reveal that the proposed approach has the ability to automatically generate the reachability tree for the corresponding FPN correctly.

show abstract

“…These issues exist in any field, e.g. business [1], environment [2,3] smartphone [4], and fraud [5].…”

Section: Introductionmentioning

confidence: 99%

Determining Process Model Using Time-Based Process Mining and Control-Flow Pattern

et al. 2016

View full text Add to dashboard Cite

Determining right model of business process from event log is the purpose of process discovery. However some problems i.e the inability to discover OR, noise IntroductionDetermining model of business process from event log is the main purpose of process discovery. Process discovery is a challenging task in process mining. It is a set of techniques which automatically construct a model of an organization`s current activities and its major activities variations. These techniques use event log of activities within an organization. The business process model is analyzed to show the complexity of issues in activities and how to solve them. These issues exist in any field, e.g. business Process discovery comes up with many algorithms, e.g. alpha, alpha+, alpha++ [6]. The alpha, alpha+, and alpha++ cannot deal with noise, incompleteness issues and OR conditional. Heuristic miner algorithms [7,9] come up to solve the noise problem. However, most of the algorithms are unable to find OR conditional model. The existing algorithm frequently discovers the OR conditional as AND parallel or XOR conditional. The thought of parallel model discovery will change the result of activities [8]. When "wait and see" behavior model synchronization is occured, it needs OR parallel to model the parallel split and join. The "wait and see" behavior model synchronization occured when the actor can choose only one activity, all activity, or more than one activity in parallel split and join. In this paper we proposed ideas to discover OR conditional within business process model.One of important things from process mining is the idea of completeness which is related to noise. Incompleteness leads to false parallel relations discovery, e.g the discovered parallel relation is XOR but the right parallel relation in business process is OR. The new representation of OR-split uses combination the existing XOR-split and AND-split to make the model easier to be analyzed [13]. In other hand temporal activity-based algorithm [8] and control-flow pattern can handle discovery of business process model with incompleteness and same frequency noise issues. Non-linear dependence in temporal activity-based algorithm is used to solve incompleteness problem since it can discover more relation than linear dependence. Controlflow pattern is used to solve same amounts of noise frequency issues because it discovers relation based on transaction function of activity, therefore it can choose non noise relation in business process model.

show abstract

Autonomous tracking of chemical plumes developed in both diffusive and turbulent airflow environments using Petri nets

Cited by 17 publications

References 43 publications

Modified Time-Based Heuristics Miner for Parallel Business Processes

Modified Time-Based Heuristics Miner for Parallel Business Processes

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

Determining Process Model Using Time-Based Process Mining and Control-Flow Pattern

Contact Info

Product

Resources

About