发布求助
文献互助 智能选刊 最新文献

Time最新文献

筛选
英文 中文
Temporal Modalities in Answer Set Programming (Invited Talk) 答案集规划中的时间模态(特邀演讲)
Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.2
Pedro Cabalar
{"title":"Temporal Modalities in Answer Set Programming (Invited Talk)","authors":"Pedro Cabalar","doi":"10.4230/LIPIcs.TIME.2020.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.2","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"13 1","pages":"2:1-2:5"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81679256","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}
引用次数: 0
A Note on C² Interpreted over Finite Data-Words 有限数据字上C²解释的一个注记
Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.17
Bartosz Bednarczyk, Piotr Witkowski
{"title":"A Note on C² Interpreted over Finite Data-Words","authors":"Bartosz Bednarczyk, Piotr Witkowski","doi":"10.4230/LIPIcs.TIME.2020.17","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.17","url":null,"abstract":"We consider the satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers, interpreted over finite words with data, denoted here with C2[≤, succ,∼, πbin ]. In our scenario, we allow for using arbitrary many uninterpreted binary predicates from πbin, two navigational predicates ≤ and succ over word positions as well as a data-equality predicate ∼. We prove that the obtained logic is undecidable, which contrasts with the decidability of the logic without counting by Montanari, Pazzaglia and Sala [27]. We supplement our results with decidability for several sub-fragments of C2[≤, succ,∼, πbin], e.g. without binary predicates, without successor succ, or under the assumption that the total number of positions carrying the same data value in a data-word is bounded by an a priori given constant. 2012 ACM Subject Classification Theory of computation → Logic and verification","PeriodicalId":75226,"journal":{"name":"Time","volume":"27 1","pages":"17:1-17:14"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81783176","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}
引用次数: 2
Mining Significant Temporal Networks Is Polynomial 挖掘有意义的时间网络是多项式
Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.11
G. Sciavicco, Matteo Zavatteri, T. Villa
{"title":"Mining Significant Temporal Networks Is Polynomial","authors":"G. Sciavicco, Matteo Zavatteri, T. Villa","doi":"10.4230/LIPIcs.TIME.2020.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.11","url":null,"abstract":"A Conditional Simple Temporal Network with Uncertainty and Decisions (CSTNUD) is a formalism that tackles controllable and uncontrollable durations as well as controllable and uncontrollable choices simultaneously. In the classic top-down model-based engineering approach, a designer builds a CSTNUD to model, validate and execute some temporal plan of interest. Instead, in this paper, we investigate the bottom-up approach by providing a deterministic polynomial time algorithm to mine a CSTNUD from a set of execution traces (i.e., a log). This paper paves the way for the design of controllable temporal networks mined from traces that also contain information on uncontrollable events. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning; Information systems → Data mining; Computing methodologies → Planning and scheduling; Mathematics of computing → Graph algorithms","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"11:1-11:12"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79837365","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}
引用次数: 2
The Horn Fragment of Branching Algebra 分支代数的角片段
Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.5
A. Bertagnon, M. Gavanelli, A. Passantino, G. Sciavicco, S. Trevisani
{"title":"The Horn Fragment of Branching Algebra","authors":"A. Bertagnon, M. Gavanelli, A. Passantino, G. Sciavicco, S. Trevisani","doi":"10.4230/LIPIcs.TIME.2020.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.5","url":null,"abstract":"Branching Algebra is the natural branching-time generalization of Allen’s Interval Algebra. As in the linear case, the consistency problem for Branching Algebra is NP-hard. Being relatively new, however, not much is known about the computational behaviour of the consistency problem of its sub-algebras, except in the case of the recently found subset of convex branching relations, for which the consistency of a network can be tested via path consistency and it is therefore deterministic polynomial. In this paper, following Nebel and Burckert, we define the Horn fragment of Branching Algebra, and prove that it is a sub-algebra of the latter, being closed under inverse, intersection, and composition, that it strictly contains both the convex fragment of Branching Algebra and the Horn fragment of Interval Algebra, and that its consistency problem can be decided via path consistency. Finally, we experimentally prove that the Horn fragment of Branching Algebra can be used as an heuristic for checking the consistency of a generic network with a considerable improvement over the convex subset.","PeriodicalId":75226,"journal":{"name":"Time","volume":"144 1","pages":"5:1-5:16"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85604014","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
Conditional Simple Temporal Networks with Uncertainty and Decisions 具有不确定性和决策的条件简单时间网络
Time Pub Date : 2019-12-01 DOI: 10.4230/LIPIcs.TIME.2017.23
Matteo Zavatteri
{"title":"Conditional Simple Temporal Networks with Uncertainty and Decisions","authors":"Matteo Zavatteri","doi":"10.4230/LIPIcs.TIME.2017.23","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2017.23","url":null,"abstract":"Abstract A Conditional Simple Temporal Network with Uncertainty (CSTNU) is a formalism able to model temporal plans subject to both conditional constraints and uncertain durations. The combination of these two characteristics represents the uncontrollable part of the network. That is, before the network starts executing, we do not know completely which time points and constraints will be taken into consideration nor how long the uncertain durations will last. Dynamic Controllability (DC) implies the existence of a strategy scheduling the time points of the network in real time depending on how the uncontrollable part behaves. Despite all this, CSTNUs fail to model temporal plans in which a few conditional constraints are under control and may therefore influence (or be influenced by) the uncontrollable part. To bridge this gap, this paper proposes Conditional Simple Temporal Networks with Uncertainty and Decisions (CSTNUDs) which introduce decision time points into the specification in order to operate on this conditional part under control. We model the dynamic controllability checking (DC-checking) of a CSTNUD as a two-player game in which each player makes his moves in his turn at a specific time instant. We give an encoding into timed game automata for a sound and complete DC-checking. We also synthesize memoryless execution strategies for CSTNUDs proved to be DC and carry out an experimental evaluation with , a tool that we have designed for CSTNUDs to make the approach fully automated.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"23:1-23:17"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45646070","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}
引用次数: 43
Towards Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans 时间计划解耦鲁棒包络的高效随时计算与执行
Time Pub Date : 2019-11-17 DOI: 10.4230/LIPIcs.TIME.2021.13
Michael Cashmore, A. Cimatti, D. Magazzeni, A. Micheli, Parisa Zehtabi
{"title":"Towards Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans","authors":"Michael Cashmore, A. Cimatti, D. Magazzeni, A. Micheli, Parisa Zehtabi","doi":"10.4230/LIPIcs.TIME.2021.13","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.13","url":null,"abstract":"One of the major limitations for the employment of model-based planning and scheduling in practical applications is the need of costly re-planning when an incongruence between the observed reality and the formal model is encountered during execution. Robustness Envelopes characterize the set of possible contingencies that a plan is able to address without re-planning, but their exact computation is extremely expensive; furthermore, general robustness envelopes are not amenable for efficient execution. In this paper, we present a novel, anytime algorithm to approximate Robustness Envelopes, making them scalable and executable. This is proven by an experimental analysis showing the efficiency of the algorithm, and by a concrete case study where the execution of robustness envelopes significantly reduces the number of re-plannings.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"13:1-13:14"},"PeriodicalIF":0.0,"publicationDate":"2019-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47775253","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}
引用次数: 0
Computing the Fourier Transformation over Temporal Data Streams (Invited Talk) 计算时间数据流的傅里叶变换(特邀演讲)
Time Pub Date : 2019-10-19 DOI: 10.4230/LIPIcs.TIME.2019.1
Michael H. Böhlen, Muhammad Saad
{"title":"Computing the Fourier Transformation over Temporal Data Streams (Invited Talk)","authors":"Michael H. Böhlen, Muhammad Saad","doi":"10.4230/LIPIcs.TIME.2019.1","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.1","url":null,"abstract":"In radio astronomy the sky is continuously scanned to collect frequency information about celestial objects. The inverse 2D Fourier transformation is used to generate images of the sky from the collected frequency information. We propose an algorithm that incrementally refines images by processing frequency information as it arrives in a temporal data stream. A direct implementation of the refinement with the discrete Fourier transformation requires O(N^2) complex multiplications to process an element of the stream. We propose a new algorithm that avoids recomputations and only requires O(N) complex multiplications.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"1:1-1:4"},"PeriodicalIF":0.0,"publicationDate":"2019-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42406063","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}
引用次数: 0
A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic 一阶线性时序逻辑表达片断的一个有界域性质
Time Pub Date : 2019-10-16 DOI: 10.4230/LIPIcs.TIME.2019.15
Quentin Peyras, Julien Brunel, D. Chemouil
{"title":"A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic","authors":"Quentin Peyras, Julien Brunel, D. Chemouil","doi":"10.4230/LIPIcs.TIME.2019.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.15","url":null,"abstract":"First-Order Linear Temporal Logic (FOLTL) is well-suited to specify infinite-state systems. However, \u0000FOLTL satisfiability is not even semi-decidable, thus preventing automated verification. To address \u0000this, a possible track is to constrain specifications to a decidable fragment of FOLTL, but known \u0000fragments are too restricted to be usable in practice. In this paper, we exhibit various fragments of \u0000increasing scope that provide a pertinent basis for abstract specification of infinite-state systems. \u0000We show that these fragments enjoy the Bounded Domain Property (any satisfiable FOLTL formula \u0000has a model with a finite, bounded FO domain), which provides a basis for complete, automated \u0000verification by reduction to LTL satisfiability. Finally, we present a simple case study illustrating \u0000the applicability and limitations of our results.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"15:1-15:16"},"PeriodicalIF":0.0,"publicationDate":"2019-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47102565","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}
引用次数: 2
Minimisation of Models Satisfying CTL Formulas 满足CTL公式的模型的最小化
Time Pub Date : 2019-10-16 DOI: 10.4230/LIPIcs.TIME.2019.13
S. Cerrito, Amélie David, V. Goranko
{"title":"Minimisation of Models Satisfying CTL Formulas","authors":"S. Cerrito, Amélie David, V. Goranko","doi":"10.4230/LIPIcs.TIME.2019.13","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.13","url":null,"abstract":"We study the problem of minimisation of a given finite pointed Kripke model satisfying a given CTL formula, with the only objective to preserve the satisfaction of that formula in the resulting reduced model. We consider minimisations of the model with respect both to state-based redundancies and formula-based redundancies in that model. We develop a procedure computing all such minimisations, illustrate it with some examples, and provide some complexity analysis for it.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"13:1-13:15"},"PeriodicalIF":0.0,"publicationDate":"2019-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45258552","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}
引用次数: 0
Towards Certified Model Checking for PLTL Using One-Pass Tableaux 使用一次表实现PLTL的认证模型检查
Time Pub Date : 2019-10-15 DOI: 10.4230/LIPIcs.TIME.2019.12
Alex Abuin, A. Bolotov, Unai Díaz-de-Cerio, Montserrat Hermo, P. Lucio
{"title":"Towards Certified Model Checking for PLTL Using One-Pass Tableaux","authors":"Alex Abuin, A. Bolotov, Unai Díaz-de-Cerio, Montserrat Hermo, P. Lucio","doi":"10.4230/LIPIcs.TIME.2019.12","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.12","url":null,"abstract":"The standard model checking setup analyses whether the given system specification satisfies a dedicated temporal property of the system, providing a positive answer here or a counter-example. At the same time, it is often useful to have an explicit proof that certifies the satisfiability. This is exactly what the {it certified model checking (CMC)} has been introduced for. The paper argues that one-pass (context-based) tableau for PLTL can be efficiently used in the CMC setting, emphasising the following two advantages of this technique. First, the use of the context in which the eventualities occur, forces them to fulfil as soon as possible. Second, a dual to the tableau sequent calculus can be used to formalise the certificates. The combination of the one-pass tableau and the dual sequent calculus enables us to provide not only counter-examples for unsatisfied properties, but also proofs for satisfied properties that can be checked in a proof assistant. \u0000In addition, the construction of the tableau is enriched by an embedded solver, to which we dedicate those (propositional) computational tasks that are costly for the tableaux rules applied solely. The combination of the above techniques is particularly helpful to reason about large (system) specifications.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"12:1-12:18"},"PeriodicalIF":0.0,"publicationDate":"2019-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46079718","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信