Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Application and Theory of Petri Nets and Concurrency, 2012
Article type: Research Article
Authors: Martos-Salgado, María | Rosa-Velardo, Fernando
Affiliations: Facultad de Informática, Universidad Complutense de Madrid, Spain. mrmartos@estumail.ucm.es | Facultad de Informática, Universidad Complutense de Madrid, Spain. fernandorosa@sip.ucm.es
Note: [] Authors supported by the Spanish projects STRONGSOFT TIN2012-39391-C04-04, DESAFIOS10 TIN2009-14599-C03-01 and PROMETIDOS S2009/TIC-1465. Address for correspondence: Facultad de Informática. C\Prof. José García Santesmases, s/n - 28040 Madrid, Spain
Note: [] Authors supported by the Spanish projects STRONGSOFT TIN2012-39391-C04-04, DESAFIOS10 TIN2009-14599-C03-01 and PROMETIDOS S2009/TIC-1465. Address for correspondence: Facultad de Informática. C\Prof. José García Santesmases, s/n - 28040 Madrid, Spain
Abstract: We extend workflow Petri nets (wf-nets) with discrete prices, by associating a price to the execution of a transition and to the storage of tokens. We first define the safety and the soundness problems for priced wf-nets. A priced wf-net is safe if no execution costs more than a given budget. The soundness problem is that of deciding whether the workflow can always terminate properly, where in the priced setting “properly” also means that the execution does not cost more than a given threshold. Then, we study safety and soundness of resource-constrained workflow nets (rcwf-nets), an extension of wf-nets for the modeling of concurrent executions of a workflow, sharing some global resources. We develop a framework in which to study safety and soundness for priced rcwf-nets, that is parametric on the cost model. Then, that framework is instantiated, obtaining the cases in which the sum, the maximum, the average and the discounted sum of the prices of all instances are considered. We study the decidability and the complexity of these properties, together with their relation.
DOI: 10.3233/FI-2014-1004
Journal: Fundamenta Informaticae, vol. 131, no. 1, pp. 55-80, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl