Title

Timed Workflow Nets

Abstract

In this paper, 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 timed Petri nets can be reduced in linear time to the same properties for untimed Petri nets. Therefore, the soundness property for timed workflow nets can be checked as efficiently as for workflow nets. © 2005 IEEE.

Publication Date

12-1-2005

Publication Title

Proceedings - Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2005

Volume

2005

Number of Pages

361-366

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/SYNASC.2005.75

Socpus ID

33847230218 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/33847230218

This document is currently not available here.

Share

COinS