期刊
INFORMATION PROCESSING LETTERS
卷 98, 期 5, 页码 188-194出版社
ELSEVIER
DOI: 10.1016/j.ipl.2006.01.012
关键词
weighted timed automata; weighted timed games; real-time systems
In this paper, we strengthen two recent undecidability results about weighted timed automata, an extension of timed automata with cost variables. More precisely, we propose new encodings of a Minsky machine. that only require three clocks and one stopwatch cost, while previous reductions required five clocks and one stopwatch cost. (c) 2006 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据