Well-structured transition systems everywhere!
Theoretical Computer Science
Introduction to algorithms
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Modeling, Simulation and Analysis of Business Processes
Business Process Management, Models, Techniques, and Empirical Studies
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Timed automata with observers under energy constraints
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
BPMN: how much does it cost? an incremental approach
BPM'07 Proceedings of the 5th international conference on Business process management
ACM Transactions on Computational Logic (TOCL)
International Journal of High Performance Computing Applications
A classification of the expressive power of well-structured transition systems
Information and Computation
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing
Dynamic soundness in resource-constrained workflow nets
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Computing Optimal Coverability Costs in Priced Timed Petri Nets
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Soundness of resource-constrained workflow nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Instance deadlock: a mystery behind frozen programs
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Cost soundness for priced resource-constrained workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
| Hi-index | 0.00 |
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.