E-timed Workflow Nets

Authors:
Ferucio Laurentiu Tiplea;Geanina Ionela Macovei
Affiliations:
"Al. I. Cuza" University of Iasi, Romania;Iasi County Council, Romania
Venue:
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Year:
2006

Citing 0
Cited 5

Soundness for S- and A-timed workflow nets is undecidable

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Analysis and applications of timed service protocols

ACM Transactions on Software Engineering and Methodology (TOSEM)
Modeling and verifying timed compensable workflows and an application to health care

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
From Implicit to Explicit Transitions in Business Protocols: A Semantic-Based Transformation

International Journal of Web Services Research
From Implicit to Explicit Transitions in Business Protocols: A Semantic-Based Transformation

International Journal of Web Services Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, E-Timed Workflow Nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for E-timed Petri nets can be reduced to the same properties for Petri nets with zero-tests on bounded places. As these two properties are decidable for Petri nets with zero-tests on bounded places, the soundness property for E-timed workflow nets is decidable.