Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Authors:
Parosh Aziz Abdulla;Richard Mayr
Affiliations:
Uppsala University, Sweden;University of Edinburgh, UK
Venue:
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
Year:
2009

Citing 10
Cited 10

Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems

IEEE Transactions on Software Engineering
Decidability of a temporal logic problem for petri nets

IDTC Second international conference on Database theory
A theory of timed automata

Theoretical Computer Science
Optimal Paths in Weighted Timed Automata

HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Timed Petri Nets and BQOs

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
On Non-Decidability of Reachability for Timed-Arc Petri Nets

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
On the optimal reachability problem of weighted timed automata

Formal Methods in System Design
Decidability of properties of timed-arc Petri nets

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets

How to Tackle Integer Weighted Automata Positivity

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
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
The reachability problem for vector addition system with one zero-test

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Decidability of LTL for vector addition systems with one zero-test

RP'11 Proceedings of the 5th international conference on Reachability problems
Algorithmic verification of asynchronous programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
The minimal cost reachability problem in priced timed pushdown systems

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Model checking inconsistency recovery costs

ICSOC'11 Proceedings of the 2011 international conference on Service-Oriented Computing
Cost soundness for priced resource-constrained workflow nets

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Safety and Soundness for Priced Resource-Constrained Workflow Nets

Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.