One-Clock Priced Timed Games are PSPACE-hard

被引：1

作者：

Fearnley, John ^{[1
]}

Ibsen-Jensen, Rasmus ^{[1
]}

Savani, Rahul ^{[1
]}

机构：

[1] Univ Liverpool, Dept Comp Sci, Liverpool, Merseyside, England

来源：

PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) | 2020年

关键词：

Priced timed games; computational complexity; game theory; OPTIMAL REACHABILITY; OPTIMAL STRATEGIES; MODEL-CHECKING; AUTOMATA;

D O I：

10.1145/3373718.3394772

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The main result of this paper is that computing the value of a one-clock priced timed game (OCPTG) is PSPACE-hard. Along the way, we provide a family of OCPTGs that have an exponential number of event points. Both results hold even in very restricted classes of games such as DAGs with treewidth three. Finally, we provide a number of positive results, including polynomial-time algorithms for even more restricted classes of OCPTGs such as trees.

引用

下载

页码：397 / 409

页数：13

共 36 条

[1] ONE-CLOCK PRICED TIMED GAMES WITH NEGATIVE WEIGHTS
Brihaye, Thomas
Geeraerts, Gilles
Haddad, Axel
Lefaucheux, Engel
Monmege, Benjamin
LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 18 (03) : 1 - 17
[2] MODEL CHECKING ONE-CLOCK PRICED TIMED AUTOMATA
Bouyer, Patricia
Larsen, Kim G.
Markey, Nicolas
LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (02)
[3] Model-checking one-clock priced timed automata
Bouyer, Patricia
Larsen, Kim G.
Markey, Nicolas
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2007, 4423 : 108 - 122
[4] Phutball is PSPACE-hard
Dereniowski, Dariusz
THEORETICAL COMPUTER SCIENCE, 2010, 411 (44-46) : 3971 - 3978
[5] Almost optimal strategies in one clock priced timed games
Bouyer, Patricia
Larsen, Kim G.
Markey, Nicolas
Rasmussen, Jacob Illum
FSTTCS 2006: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2006, 4337 : 345 - +
[6] Celeste is PSPACE-hard
Chung, Lily
Demaine, Erik D.
THAI JOURNAL OF MATHEMATICS, 2023, 21 (04): : 671 - 686
[7] Universality Analysis for One-Clock Timed Automata
Abdulla, Parosh Aziz
Deneux, Johann
Ouaknine, Joel
Quaas, Karin
Worrell, James
FUNDAMENTA INFORMATICAE, 2008, 89 (04) : 419 - 450
[8] Solving the sabotage game is PSPACE-hard
Löding, C
Rohde, P
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 531 - 540
[9] Learning Deterministic One-clock Timed Automata Based on Timed Classification Tree
Mi J.-R.
Zhang M.-M.
An J.
Du B.-W.
Ruan Jian Xue Bao/Journal of Software, 2022, 33 (08): : 2797 - 2814
[10] One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
Verwer, Sicco
de Weerdt, Mathijs
Witteveen, Cees
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 740 - 751

← 1 2 3 4 →