2014 21st International Symposium on Temporal Representation and Reasoning最新文献_第2页

Incremental Dynamic Controllability in Cubic Worst-Case Time 三次最坏情况下的增量动态可控性

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.13

Mikael Nilsson, Jonas Kvarnström, P. Doherty

{"title":"Incremental Dynamic Controllability in Cubic Worst-Case Time","authors":"Mikael Nilsson, Jonas Kvarnström, P. Doherty","doi":"10.1109/TIME.2014.13","DOIUrl":"https://doi.org/10.1109/TIME.2014.13","url":null,"abstract":"It is generally hard to predict the exact duration of an action. Uncertainty in durations is often modeled in temporal planning by the use of upper bounds on durations, with the assumption that if an action happens to be executed more quickly, the plan will still succeed. However, this assumption is often false: If we finish cooking too early, the dinner will be cold before everyone is ready to eat. Simple Temporal Problems with Uncertainty (STPUs) allow us to model such situations. An STPU-based planner must verify that the plans it generates are executable, captured by the property of dynamic controllability. The Efficient IDC (EIDC) algorithm can do this incrementally during planning, with an amortized complexity per step of O(n3) but a worst-case complexity per step of O(n4). In this paper we show that the worst-case run-time of EIDC does occur, leading to repeated reprocessing of nodes in the STPU while verifying the dynamic controllability property. We present a new version of the algorithm, EIDC2, which through optimal ordering of nodes avoids the need for reprocessing. This gives EIDC2 a strictly lower worst-case run-time, making it the fastest known algorithm for incrementally verifying dynamic controllability of STPUs.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133311149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation 具有不确定性、分离性和观测性的时间网络动态可控性检验的完善算法

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.21

A. Cimatti, Luke Hunsberger, A. Micheli, Roberto Posenato, Marco Roveri

{"title":"Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation","authors":"A. Cimatti, Luke Hunsberger, A. Micheli, Roberto Posenato, Marco Roveri","doi":"10.1109/TIME.2014.21","DOIUrl":"https://doi.org/10.1109/TIME.2014.21","url":null,"abstract":"Temporal networks are data structures for representing and reasoning about temporal constraints on activities. Many kinds of temporal networks have been defined in the literature, differing in their expressiveness. The simplest kinds of networks have polynomial algorithms for determining their consistency or controllability, but corresponding algorithms for more expressive networks (e.g., Those that include observation nodes or disjunctive constraints) have so far been unavailable. However, recent work has introduced a new approach to such algorithms based on translating temporal networks into Timed Game Automata (TGAs) and then using off-the-shelf software to synthesize execution strategies -- or determine that none exist. So far, that approach has only been used on Simple Temporal Networks with Uncertainty, for which polynomial algorithms already exist. This paper extends the temporal-network-to-TGA approach to accommodate observation nodes and disjunctive constraints. Insodoing the paper presents, for the first time, sound and complete algorithms for checking the dynamic controllability of these more expressive networks. The translations also highlight the theoretical relationships between various kinds of temporal networks and the TGA model. The new algorithms have immediate applications in the workflow models being developed to automate business processes, including in the health-care domain.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116627019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 38

Advances in Symbolic Model Checking for Multi-agent Systems 多智能体系统符号模型检验的研究进展

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-08-24 DOI: 10.1109/TIME.2014.23

A. Lomuscio

引用次数: 0

Partially Punctual Metric Temporal Logic is Decidable 部分准时度量时间逻辑是可决定的

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-04-28 DOI: 10.1109/TIME.2014.17

Khushraj Madnani, S. Krishna, P. Pandya

{"title":"Partially Punctual Metric Temporal Logic is Decidable","authors":"Khushraj Madnani, S. Krishna, P. Pandya","doi":"10.1109/TIME.2014.17","DOIUrl":"https://doi.org/10.1109/TIME.2014.17","url":null,"abstract":"Metric Temporal Logic MTL[UI, SI] is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints I. Henzinger et al., in their seminal paper showed that the non-punctual fragment of MTL called MITL is decidable. In this paper, we sharpen this decidability result by showing that the partially punctual fragment of MTL (denoted PMTL) is decidable over strictly monotonic finite point wise time. In this fragment, we allow either punctual future modalities, or punctual past modalities, but never both together. We give two satisfiability preserving reductions from PMTL to the decidable logic MTL[UI]. The first reduction uses simple projections, while the second reduction uses a novel technique of temporal projections with oversampling. We study the tradeoff between the two reductions: while the second reduction allows the introduction of extra action points in the underlying model, the equisatisfiable MTL[UI] formula obtained is exponentially more succinct than the one obtained via the first reduction, where no oversampling of the underlying model is needed. We also show that PMTL is strictly more expressive than the fragments MTL[UI, S] and MTL[U, SI].","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Formal Methods for Dynamical Systems 动力系统的形式化方法

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2012-04-17 DOI: 10.1145/2185632.2185636

C. Belta

{"title":"Formal Methods for Dynamical Systems","authors":"C. Belta","doi":"10.1145/2185632.2185636","DOIUrl":"https://doi.org/10.1145/2185632.2185636","url":null,"abstract":"In control theory, \"complex\" models of physical processes, such as systems of differential equations, are usually checked against \"simple\" specifications, such as stability and set invariance. In formal methods, \"rich\" specifications, such as languages and formulae of temporal logics, are checked against \"simple\" models of software programs and digital circuits, such as finite transition graphs. With the development and integration of cyber physical and safety critical systems, there is an increasing need for computational tools for verification and control of complex systems from rich, temporal logic specifications. The formal verification and synthesis problems have been shown to be undecidable even for very simple classes of infinitespace continuous and hybrid systems. However, provably correct but conservative approaches, in which the satisfaction of a property by a dynamical system is implied by the satisfaction of the property by a finite over-approximation (abstraction) of the system, have received a lot of attention in recent years. Some classes of systems allowing for computationally efficient verification and control from temporal logic specifications are reviewed. For continuous and discrete-time linear systems and continuous-time multi-linear systems, it is shown that finite abstractions can be constructed through polyhedral operations only. By using techniques from model checking and automata games, this allows for verification and control from specifications given as Linear Temporal Logic (LTL) formulae over linear predicates in the state variables. A connection between the existence of Lyapunov functions and finite bisimulations is established for discrete-time linear and switched linear systems. Finally, optimality and correctness requirements are combined in a model predictive approach to generate control strategies for discrete-time linear systems. The usefulness of these computational tools is illustrated with various examples such as verification and synthesis of biological circuits in synthetic biology and motion planning and control in robotics.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129689614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1