Timing Constraint Petri Nets and Their Schedulability Analysis and Verification

2007 ◽  
Vol 18 (1) ◽  
pp. 11 ◽  
Author(s):  
Wei SONG
Keyword(s):  
Petri Nets ◽  
Schedulability Analysis ◽  
Timing Constraint

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.

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.

Sign in / Sign up

Export Citation Format

Share Document