Schedulability Analysis Algorithm of Timing Constraint Petri Nets

2012 ◽  
Vol 532-533 ◽  
pp. 1810-1814 ◽  
Author(s):  
Hui Fang Li ◽  
Fu Jian Feng
Keyword(s):  
Petri Nets ◽  
Workflow Management ◽  
Schedulability Analysis ◽  
Timing Constraints ◽  
Reliability Engineering ◽  
Timing Constraint ◽  
Constraint Analysis ◽  
Novel Approach ◽  
Two Phases ◽  
Task Sequences

A novel approach to the schedulability analysis is presented in this paper for timing constraint Petri nets, which have wide applications in the workflow management, software engineering, reliability engineering, and so on. The analysis can be conducted in two phases: finding firing sequences and timing constraint analysis, among which the first one is to find the transition sequences that transform the initial marking to a certain marking by using incidence matrix in the underlying Petri net, and the second one is to verify whether the reachable marking found in the first step is reachable with the timing constraints. The proposed method is able to pinpoint out non-schedulable transitions and adjust the timing constraints to make all the transitions schedulable within complex task sequences, while meeting the needs of the managers to schedule the tasks.

scholarly journals ANALYSIS OF TIMED PETRI NETS FOR REACHABILITY IN CONSTRUCTION APPLICATIONS/PETRI LAIKO TINKLŲ PASIEKIAMUMO TAIKYMO STATYBOJE ANALIZĖ

2008 ◽  
Vol 14 (3) ◽  
pp. 189-198 ◽  
Author(s):  
Khaled Nassar ◽  
Albert Casavant
Keyword(s):  
Petri Nets ◽  
Construction Projects ◽  
Workflow Management ◽  
Activity Cycle ◽  
Reliability Engineering ◽  
Timed Petri Nets ◽  
Initial State ◽  
Complex Processes ◽  
Model Complex ◽  
Real Time Computing

Petri nets have been used for many years to model complex processes. Examples are software design, workflow management, data analysis, concurrent programming, reliability engineering, real‐time computing systems, operating systems, distributed systems, and biological processes. Timed petri nets enable the study of timed process reachability, i. e. can a certain state in the process be reached, given an initial state of TPN representing a given process. This paper shows how the reachability of TPN can be utilized to analyze several aspects of construction projects. TPN are introduced and contrasted to Activity Cycle Diagrams and are also formalized to allow for the reachability problem to be assessed. The benefits and limitations of the analysis are presented through the classic earth-moving problem. Santrauka Petri laiko tinklai jau daugelį metų yra taikomi sudėtingiems procesams modeliuoti. Jų pavyzdžiai yra programinės įrangos kūrimas, organizacinių procesų valdymas, duomenų analizė, vientisas planavimas, patikima inžinerija, kompiuterinės sistemos, operacinės sistemos, išskirstytos sistemos ir biologiniai procesai. Petri laiko tinklai leidžia tirti apibrėžtų procesų įvykdymo pasiekiamumą per nustatytą laiką, t. y. ar tam tikra proceso būklė gali būti pasiekta turint Petri laiko tinklų pradinę būseną, aprašančią procesą. Šiame straipsnyje parodoma, kaip Petri laiko tinklų pasiekiamumas gali būti pritaikytas statybos projektams analizuoti keliais aspektais. Apibūdinami Petri laiko tinklai yra gretinami su veiksmų ciklinėmis diagramomis ir suformuoti taip, kad būtų galima įvertinti pasiekiamumo problemas. Taip pat yra pristatomi analizės privalumai ir trūkumai nagrinėjant klasikinį žemės darbų uždavinį.

Using Time Reachability Tree Logic to Specifying and Verifying Temporal Behavior of Workflow-Net

2014 ◽  
Vol 571-572 ◽  
pp. 528-534
Author(s):  
Chyun Chyi Chen ◽  
Yueh Min Huang
Keyword(s):  
Petri Nets ◽  
Workflow Management ◽  
Schedulability Analysis ◽  
Temporal Behavior ◽  
Time Petri Nets ◽  
Reachability Graph ◽  
Workflow Execution ◽  
Workflow System ◽  
Timing Properties ◽  
Reachability Tree

Workflow management has been a hot issue in both academic and industrial research. Deadline assignment is of great significance in workflow management. In order to avoid deadline violation, this paper presents an approach to the schedulability analysis of workflow system modeled in p-time Petri nets by separating timing properties from other behavior properties. The analysis of behavioral properties is conducted based on the reachability graph of the underlying p-Time Petri net, whereas timing constraints are checked in term of absolute and relative firing domains. Our technique is based on a concept called clock-stamped state class (CS-class) and temporal logic. With the reachability graph generated based on CS-class, we can directly compute the end-to-end time delay in workflow execution. We have identified a class of well-structured p-time Petri nets such that their reachability can be easy analyzed and temporal behavior can be easy analyzed by time reachability tree logical.

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
State Of The Art ◽  
Workflow Management ◽  
Explicit Representation ◽  
The Other ◽  
Application Domain ◽  
Analysis Techniques ◽  
The One

Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.

Sign in / Sign up

Export Citation Format

Share Document