| ||||||||||||||||||||||||||||||||||||||||||||||||
[BB15] Strongly generalized soundness of Time Workflow NetsConférence Internationale avec comité de lecture : ACSD 2015- 15th International Conference on Application of Concurrency to System Design, October 2015, pp.10-20, Series IEEE Computer Society, Belgique,Mots clés: Time Workflow nets; state class graphs; K-soundness; (strong) ω-soundness
Résumé:
We consider here the time Workflow nets 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
Commentaires:
to appear in
http://ieeexplore.ieee.org/
http://dblp.org
Equipe:
sys
BibTeX
|
||||||||||||||||||||||||||||||||||||||||||||||||