条件简单时态网络的动态可控性是pspace完全的

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-08-30 DOI:10.1109/TIME.2016.17

Massimo Cairo, Romeo Rizzi

{"title":"条件简单时态网络的动态可控性是pspace完全的","authors":"Massimo Cairo, Romeo Rizzi","doi":"10.1109/TIME.2016.17","DOIUrl":null,"url":null,"abstract":"Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically Controllable had still remained widely open. This issue gets settled in this paper which provides constructions, algorithms, and bridging lemmas and arguments to formally prove that: (1) the problem is PSPACE-hard, and (2) the problem lies in PSPACE.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete\",\"authors\":\"Massimo Cairo, Romeo Rizzi\",\"doi\":\"10.1109/TIME.2016.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically Controllable had still remained widely open. This issue gets settled in this paper which provides constructions, algorithms, and bridging lemmas and arguments to formally prove that: (1) the problem is PSPACE-hard, and (2) the problem lies in PSPACE.\",\"PeriodicalId\":347020,\"journal\":{\"name\":\"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.2016.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2016.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

即使在各种求解算法提出之后，检验条件时态网络是否动态可控的精确计算复杂度仍然存在很大的开放性。本文解决了这个问题，并提供了结构、算法和桥接引理和论证来形式化地证明:(1)问题是PSPACE-hard的，(2)问题位于PSPACE中。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete

Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically Controllable had still remained widely open. This issue gets settled in this paper which provides constructions, algorithms, and bridging lemmas and arguments to formally prove that: (1) the problem is PSPACE-hard, and (2) the problem lies in PSPACE.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)

自引率

0.00%

发文量