Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

被引：0

作者：

Abdulla, Parosh Aziz ^{[1
]}

Mayr, Richard ^{[2
]}

机构：

[1] Uppsala Univ, Uppsala, Sweden

[2] Univ Edinburgh, Edinburgh, Midlothian, Scotland

来源：

FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS | 2009年 / 5504卷

关键词：

REACHABILITY PROBLEM; AUTOMATA; SYSTEMS;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：348 / +

页数：3

共 17 条

[1]

ALUR R, 1994, THEORETICAL COMPUTER, V126, P235

[2]

ALUR R, 2001, LNCS, V2034, P49

[3]

[Anonymous], LECT NOTES COMPUTER

[4] MODELING AND VERIFICATION OF TIME-DEPENDENT SYSTEMS USING TIME PETRI NETS [J].