Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Computing Optimal Coverability Costs in Priced Timed Petri Nets
 

Summary: Computing Optimal Coverability Costs in Priced
Timed Petri Nets
Parosh Aziz Abdulla
Uppsala University, Sweden
Richard Mayr
University of Edinburgh, UK
Abstract--We consider timed Petri nets, i.e., unbounded Petri
nets where each token carries a real-valued clock. Transition arcs
are labeled with time intervals, which specify constraints on the
ages of tokens. Our cost model assigns token storage costs per
time unit to places, and firing costs to transitions. We study the
cost to reach a given control-state. In general, a cost-optimal run
may not exist. However, we show that the infimum of the costs
is computable.
Keywords-Formal verification; Petri nets; Timed Automata
I. INTRODUCTION
Petri nets [22], [21] are a widely used model for the study
and analysis of concurrent systems. Many different formalisms
have been proposed which extend Petri nets with clocks
and real-time constraints, leading to various definitions of

  

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

 

Collections: Computer Technologies and Information Sciences