DocumentCode
3708632
Title
Strongly Generalized Soundness of Time Workflow Nets
Author
Hanifa Boucheneb;Kamel Barkaoui
Author_Institution
Lab. VeryForm, Ecole Polytech. de Montrο
fYear
2015
fDate
6/1/2015 12:00:00 AM
Firstpage
130
Lastpage
139
Abstract
We consider here the time Workflow nets [11], [17] with an arbitrary large number, denoted ω of tokens in their source places and investigate the verification of their soundness. We first revisit the notion of (strong) soundness in the context of permanent and concurrent evolutions of process instances. Then, we show how to verify (strong) ω-soundness of time workflow nets, using a forward reachability analysis.
Keywords
"Petri nets","Semantics","Reachability analysis","Delays","Context","Time factors","Upper bound"
Publisher
ieee
Conference_Titel
Application of Concurrency to System Design (ACSD), 2015 15th International Conference on
Electronic_ISBN
1550-4808
Type
conf
DOI
10.1109/ACSD.2015.22
Filename
7352433
Link To Document