Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00087227" target="_blank" >RIV/00216224:14330/15:00087227 - isvavai.cz</a>
Result on the web
<a href="http://content.iospress.com/articles/fundamenta-informaticae/fi1246" target="_blank" >http://content.iospress.com/articles/fundamenta-informaticae/fi1246</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FI-2015-1246" target="_blank" >10.3233/FI-2015-1246</a>

Result language
angličtina
Original language name
Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics
Original language description
Analysis of workflow processes with quantitative aspectslike timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and studythe foundational problems of soundness and strong (time-bounded)soundness.We first consider the discrete-time semantics (integer delays)and explore the decidability of the soundness problemsand show, among others, that soundness is decidable for monotonic workflow nets while reachability is undecidable.For general timed-arc workflow nets soundness andstrong soundness become undecidable, though we can design efficientverification algorithms for the subclass of bounded nets.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)