model-checking one-clock priced timed automata

model-checking one-clock priced timed automata

ID:34449784

大小:227.38 KB

页数:15页

时间:2019-03-06

model-checking one-clock priced timed automata_第1页
model-checking one-clock priced timed automata_第2页
model-checking one-clock priced timed automata_第3页
model-checking one-clock priced timed automata_第4页
model-checking one-clock priced timed automata_第5页
资源描述:

《model-checking one-clock priced timed automata》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、Model-CheckingOne-ClockPricedTimedAutomataPatriciaBouyer1⋆,KimG.Larsen2⋆⋆,andNicolasMarkey1⋆1LSV,CNRS&ENSdeCachan,France{bouyer,markey}@lsv.ens-cachan.fr2AalborgUniversity,Denmarkkgl@cs.aau.dkAbstract.Weconsiderthemodelofpriced(a.k.a.weighted)timedau-tomata,anextensionoftimedautomatawithcostinfo

2、rmationonbothlocationsandtransitions.Weprovethatmodel-checkingthisclassofmodelsagainstthelogicWCTL,CTLwithcost-constrainedmodalities,isPSPACE-completeunderthe“single-clock”assumption.Incontrast,ithasbeenrecentlyprovedthatthemodel-checkingproblemisundecid-ableforthismodelassoonasthesystemhasthree

3、clocks.Wealsoprove∗thatthemodel-checkingofWCTLbecomesundecidable,evenunderthis“single-clock”assumption.1IntroductionAninterestingdirectionofreal-timemodel-checkingthathasrecentlyreceivedsubstantialattentionistheextensionandre-targetingoftimedautomatatech-nologytowardsoptimalschedulingandcontroll

4、ersynthesis[1,18,7].Inparticu-lar,aspartofthiseffort,thenotionofpriced(orweighted)timedautomata[4,3]hasbeenpromotedasausefulextensionoftheclassicalmodeloftimedautomataallowingcontinuousconsumptionofresources(e.g.energy)tobemodelledandanalyzed.Anumberofoptimizationproblemshavebeenshowndecidablefor

5、pricedtimedautomataincludingminimum-costreachability[4,3],optimal(minimumandmaximumcost)reachabilityinmulti-pricedsettings[17]andcost-optimalinfiniteschedules[6,7].Unfortunately,theadditionofcostcomeswithaprice:certainproblemsbecomeundecidableforpricedtimedautomata.Infact,in[11]ithasrecentlybeens

6、hownthattheproblemofdeterminingcost-optimalwinningstrategiesforpricedtimedgamesisnotcomputable.Also,bythesameauthors,ithasbeenshownthatthemodel-checkingproblemforpricedtimedautomataw.r.t.WCTL—CTLwithcost-constrainedmodalities—isundecidable[10].In[5]ithasbeenshownthatthesenegativeresultsholdevenf

7、orpricedtimed(game)automatawithnomorethanthreeclocks.⋆PartlysupportedbyACI“S´ecurit´e&Informatique”CORTOS.⋆⋆PartlysupportedbyaninvitedprofessorshipfromENSCachan.However,whenrestrictingtothesettingofpricedtimedgameautomatawit

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。