Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
 

Summary: Minimal Cost Reachability/Coverability in Priced
Timed Petri Nets
Parosh Aziz Abdulla1
and Richard Mayr2
1
Uppsala University, Sweden
2
University of Edinburgh, UK
Abstract. We extend discrete-timed Petri nets with a cost model that assigns to-
ken storage costs to places and firing costs to transitions, and study the minimal
cost reachability/coverability problem. We show that the minimal costs are com-
putable 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.
1 Introduction
Petri nets are one of the most widely used models for the study and analysis of concur-
rent systems. Furthermore, several different models have been introduced in [1, 7, 14,
13, 4, 9, 6] which extend the classical model by introducing timed behaviors.
We consider Timed Petri Nets (TPNs) in which each token has an `age' represented
by a natural number [1, 7]. A marking of the net is a mapping which assigns a multiset
of natural numbers to each place. The multiset represents the numbers and ages of the

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences