Time最新文献_第5页

Complexity of Qualitative Timeline-Based Planning 基于时间线的定性计划的复杂性

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.16

Dario Della Monica, N. Gigante, S. L. Torre, A. Montanari

{"title":"Complexity of Qualitative Timeline-Based Planning","authors":"Dario Della Monica, N. Gigante, S. L. Torre, A. Montanari","doi":"10.4230/LIPIcs.TIME.2020.16","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.16","url":null,"abstract":"The timeline-based approach to automated planning was originally developed in the context of space missions. In this approach, problem domains are expressed as systems consisting of independent but interacting components whose behaviors over time, the timelines, are governed by a set of temporal constraints, called synchronization rules. Although timeline-based system descriptions have been successfully used in practice for decades, the research on the theoretical aspects only started recently. In the last few years, some interesting results have been shown concerning both its expressive power and the computational complexity of the related planning problem. In particular, the general problem has been proved to be EXPSPACE-complete. Given the applicability of the approach in many practical scenarios, it is thus natural to ask whether computationally simpler but still expressive fragments can be identified. In this paper, we study the timeline-based planning problem with the restriction that only qualitative synchronization rules, i.e., rules without explicit time bounds in the constraints, are allowed. We show that the problem becomes PSPACE-complete. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"16:1-16:13"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88344746","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}

引用次数: 3

Verifying Autonomous Robots: Challenges and Reflections (Invited Talk) 验证自主机器人:挑战与思考(特邀演讲)

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.1

C. Dixon

引用次数: 0

Dynamic Branching in Qualitative Constraint Networks via Counting Local Models 基于计数局部模型的定性约束网络的动态分支

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.12

Michael Sioutis, D. Wolter

{"title":"Dynamic Branching in Qualitative Constraint Networks via Counting Local Models","authors":"Michael Sioutis, D. Wolter","doi":"10.4230/LIPIcs.TIME.2020.12","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.12","url":null,"abstract":"11 We introduce and evaluate dynamic branching strategies for solving Qualitative Constraint 12 Networks ( QCN s), which are networks that are mostly used to represent and reason about spatial 13 and temporal information via the use of simple qualitative relations, e.g., a constraint can be “Task A 14 is scheduled after or during Task C ”. In qualitative constraint-based reasoning, the state-of-the-art 15 approach to tackle a given QCN consists in employing a backtracking algorithm, where the branching 16 decisions during search are governed by the restrictiveness of the possible relations for a given 17 constraint (e.g., after can be more restrictive than during ). In the literature, that restrictiveness is 18 deﬁned a priori by means of static weights that are precomputed and associated with the relations 19 of a given calculus, without any regard to the particulars of a given network instance of that 20 calculus, such as its structure. In this paper, we address this limitation by proposing heuristics that 21 dynamically associate a weight with a relation, based on the count of local models (or local scenarios ) 22 that the relation is involved with in a given QCN ; these models are local in that they focus on 23 triples of variables instead of the entire QCN . Therefore, our approach is adaptive and seeks to make 24 branching decisions that preserve most of the solutions by determining what proportion of local 25 solutions agree with that decision. Experimental results with a random and a structured dataset of 26 QCN s of Interval Algebra show that it is possible to achieve up to 5 times better performance for 27 structured instances, whilst maintaining non-negligible gains of around 20%","PeriodicalId":75226,"journal":{"name":"Time","volume":"87 1","pages":"12:1-12:15"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81245403","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}

引用次数: 6

Universal Solutions in Temporal Data Exchange 时态数据交换中的通用解决方案

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.8

Zehui Cheng, Phokion G. Kolaitis

引用次数: 1

Time and Business Process Management: Problems, Achievements, Challenges (Invited Talk) 时间与业务流程管理:问题、成就与挑战(特邀演讲)

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.3

Johann Eder, M. Franceschetti

{"title":"Time and Business Process Management: Problems, Achievements, Challenges (Invited Talk)","authors":"Johann Eder, M. Franceschetti","doi":"10.4230/LIPIcs.TIME.2020.3","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.3","url":null,"abstract":"Processes have been successfully introduced for modeling dynamic phenomena in many areas like business, production, health care, etc. Many of these applications require to adequately deal with temporal aspects. Process models need to express temporal durations, temporal constraints like allowed time between events, and deadlines. For checking the correctness of process definitions with temporal constraints, different notions and algorithms have been developed. Schedules for the execution of processes can be computed and proactive time management supports process managers to avoid time failures during the execution of a process. We present an overview of the problems and the requirements for treating time in business processes and the solutions achieved by applying results and techniques of research in temporal representation and reasoning. We reflect where expectations have not yet been met and sketch challenges in temporal representation and reasoning for addressing advanced requirements of the management of business processes. 2012 ACM Subject Classification Information systems → Process control systems; Applied computing → Business process management; Information systems → Temporal data","PeriodicalId":75226,"journal":{"name":"Time","volume":"9 1","pages":"3:1-3:8"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74751071","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}

引用次数: 4

Non-Simultaneity as a Design Constraint 作为设计约束的非同时性

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.13

Jean Guyomarc'h, François Guerret, Bilal El Mejjati, Emmanuel Ohayon, B. Vincke, A. Mérigot

引用次数: 0

One-Pass Context-Based Tableaux Systems for CTL and ECTL 用于CTL和ECTL的基于上下文的单通道表系统

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.14

Alex Abuin, A. Bolotov, Montserrat Hermo, P. Lucio

{"title":"One-Pass Context-Based Tableaux Systems for CTL and ECTL","authors":"Alex Abuin, A. Bolotov, Montserrat Hermo, P. Lucio","doi":"10.4230/LIPIcs.TIME.2020.14","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.14","url":null,"abstract":"When building tableau for temporal logic formulae, applying a two-pass construction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second `pass', we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtaining a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one pass context based tableaux in certified model checking for a variety of CTL-type branching-time logics.","PeriodicalId":75226,"journal":{"name":"Time","volume":"16 1","pages":"14:1-14:20"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81824944","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

Parametric Model Checking Continuous-Time Markov Chains 参数模型检验连续时间马尔可夫链

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.7

Cătălin Ilie, J. Worrell

引用次数: 1

Stab-Forests: Dynamic Data Structures for Efficient Temporal Query Processing 刺森林:用于高效时态查询处理的动态数据结构

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.18

Jelle Hellings, Yuqing Wu

{"title":"Stab-Forests: Dynamic Data Structures for Efficient Temporal Query Processing","authors":"Jelle Hellings, Yuqing Wu","doi":"10.4230/LIPIcs.TIME.2020.18","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.18","url":null,"abstract":"Many sources of data have temporal start and end attributes or are created in a time-ordered manner. Hence, it is only natural to consider joining datasets based on these temporal attributes. To do so efficiently, several internal-memory temporal join algorithms have recently been proposed. Unfortunately, these join algorithms are designed to join entire datasets and cannot efficiently join skewed datasets in which only few events participate in the join result. To support high-performance internal-memory temporal joins of skewed datasets, we propose the skip-join algorithm, which operates on stab-forests. The stab-forest is a novel dynamic data structure for indexing temporal data that allows efficient updates when events are appended in a time-based order. Our stab-forests efficiently support not only traditional temporal stab-queries, but also more general multi-stab-queries. We conducted an experimental evaluation to compare the skip-join algorithm with state-of-the-art techniques using real-world datasets. We observed that the skip-join algorithm outperforms other techniques by an order of magnitude when joining skewed datasets and delivers comparable performance to other techniques on non-skewed datasets. 2012 ACM Subject Classification Information systems → Join algorithms; Information systems → Temporal data","PeriodicalId":75226,"journal":{"name":"Time","volume":"120 1","pages":"18:1-18:19"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75791444","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

Window-Slicing Techniques Extended to Spanning-Event Streams 扩展到跨事件流的窗口切片技术

Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.10

A. Suzanne, G. Raschia, José Martinez, Damien Tassetti

引用次数: 0