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

Time最新文献

筛选
英文 中文
Achieving a Sequenced, Relational Query Language with Log-Segmented Timestamps 实现具有日志分段时间戳的有序关系查询语言
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.14
C. Dyreson, Md Quamrul Ahsan
{"title":"Achieving a Sequenced, Relational Query Language with Log-Segmented Timestamps","authors":"C. Dyreson, Md Quamrul Ahsan","doi":"10.4230/LIPIcs.TIME.2021.14","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.14","url":null,"abstract":"In a period-timestamped, relational temporal database, each tuple is timestamped with a period. The timestamp records when the tuple is “alive” in some temporal dimension. Sequenced semantics is a special semantics for evaluating a query in a temporal database. The semantics stipulates that the query must, in effect, be evaluated simultaneously in each time instant using the tuples alive at that instant. Previous research has proposed changes to the query evaluation engine to support sequenced semantics. In this paper we show how to achieve sequenced semantics without modifying a query evaluation engine. Our technique has two pillars. First we use log-segmented timestamps to record a tuple’s lifetime. A log-segmented timestamp divides the time-line into segments of known length. Any temporal period can be represented by a small number of such segments. Second, by taking advantage of the properties of log-segmented timestamps, we translate a sequenced relational algebra query to a non-temporal relational algebra query, using the operations already present in an unmodified, non-temporal query evaluation engine. The primary contribution of this paper is how to implement sequenced semantics using log-segmented timestamped tuples in a generic DBMS, which, to the best of our knowledge, has not been previously shown. 2012 ACM Subject Classification Information systems → Temporal data; Information systems → Relational database query languages","PeriodicalId":75226,"journal":{"name":"Time","volume":"16 1","pages":"14:1-14:13"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86159345","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
A One-Pass Tree-Shaped Tableau for Defeasible LTL 可失败LTL的一遍树形图
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.16
Anasse Chafik, Fahima Cheikh, Jean-François Condotta, I. Varzinczak
{"title":"A One-Pass Tree-Shaped Tableau for Defeasible LTL","authors":"Anasse Chafik, Fahima Cheikh, Jean-François Condotta, I. Varzinczak","doi":"10.4230/LIPIcs.TIME.2021.16","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.16","url":null,"abstract":"Defeasible Linear Temporal Logic is a defeasible temporal formalism for representing and verifying exception-tolerant systems. It is based on Linear Temporal Logic (LTL) and builds on the preferential approach of Kraus et al. for non-monotonic reasoning, which allows us to formalize and reason with exceptions. In this paper, we tackle the satisfiability checking problem for defeasible LTL. One of the methods for satisfiability checking in LTL is the one-pass tree shaped analytic tableau proposed by Reynolds. We adapt his tableau to defeasible LTL by integrating the preferential semantics to the method. The novelty of this work is in showing how the preferential semantics works in a tableau method for defeasible linear temporal logic. We introduce a sound and complete tableau method for a fragment that can serve as the basis for further exploring tableau methods for this logic. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics","PeriodicalId":75226,"journal":{"name":"Time","volume":"72 1","pages":"16:1-16:18"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86263851","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
Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk) 简单时间网络:时间表征和推理的实践基础(特邀演讲)
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.1
Luke Hunsberger, Roberto Posenato
{"title":"Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk)","authors":"Luke Hunsberger, Roberto Posenato","doi":"10.4230/LIPIcs.TIME.2021.1","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.1","url":null,"abstract":"Since Simple Temporal Networks (STNs) were first introduced in 1991, there have been numerous theoretic and algorithmic advances that have made them practical for a wide variety of applications. However, the presentation of most of the important advances have been scattered across numerous conference papers and journal articles. As a result, it is too easy for even experienced researchers to be unaware of results that could positively impact their work. In this talk we review the most important results about STNs for researchers in Artificial Intelligence who are interested in incorporating the management of time and temporal constraints into their projects. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning; Theory of computation → Network optimization; Theory of computation → Dynamic graph algorithms; Mathematics of computing → Graph algorithms","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"1:1-1:5"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76903399","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
Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic 区间时序逻辑模型检验统一算法的复杂性分析
Time Pub Date : 2020-11-01 DOI: 10.4230/LIPIcs.TIME.2019.18
L. Bozzelli, A. Montanari, A. Peron
{"title":"Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic","authors":"L. Bozzelli, A. Montanari, A. Peron","doi":"10.4230/LIPIcs.TIME.2019.18","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.18","url":null,"abstract":"Abstract Model checking (MC) for Halpern and Shoham's interval temporal logic HS has been recently shown to be decidable. An intriguing open question is its exact complexity for full HS : it is at least EXPSPACE-hard, and the only known upper bound, which exploits an abstract representation of Kripke structure paths (descriptor), is non-elementary. In this paper, we provide a uniform framework to MC for full HS and meaningful fragments of it, with a specific type of descriptor for each fragment. Then, we devise a general MC alternating algorithm, parameterized by the descriptor's type, which has a polynomially bounded number of alternations and whose running time is bounded by the length of minimal representatives of descriptors (certificates). We analyze its complexity and give tight bounds on the length of certificates. For two types of descriptor, we obtain exponential upper and lower bounds; for the other ones, we provide non-elementary lower bounds.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"18:1-18:17"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41868946","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}
引用次数: 5
Hierarchical Cost-Parity Games 分级成本平价游戏
Time Pub Date : 2020-10-08 DOI: 10.4230/LIPIcs.TIME.2017.6
L. Bozzelli, A. Murano, Giuseppe Perelli, L. Sorrentino
{"title":"Hierarchical Cost-Parity Games","authors":"L. Bozzelli, A. Murano, Giuseppe Perelli, L. Sorrentino","doi":"10.4230/LIPIcs.TIME.2017.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2017.6","url":null,"abstract":"Cost-parity games are a fundamental tool in system design for the analysis of reactive and distributed systems that recently have received a lot of attention from the formal methods research community. They allow to reason about the time delay on the requests granted by systems, with a bounded consumption of resources, in their executions. \u0000 \u0000In this paper, we contribute to research on Cost-parity games by combining them with hierarchical systems, a successful method for the succinct representation of models. We show that determining the winner of a Hierarchical Cost-parity Game is PSpace-Complete, thus matching the complexity of the proper special case of Hierarchical Parity Games. This shows that reasoning about temporal delay can be addressed at a free cost in terms of complexity.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"6:1-6:17"},"PeriodicalIF":0.0,"publicationDate":"2020-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48581032","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
TESL: A Model with Metric Time for Modeling and Simulation TESL:一种用于建模和仿真的度量时间模型
Time Pub Date : 2020-09-23 DOI: 10.4230/LIPIcs.TIME.2020.15
H. N. Van, Frédéric Boulanger, B. Wolff
{"title":"TESL: A Model with Metric Time for Modeling and Simulation","authors":"H. N. Van, Frédéric Boulanger, B. Wolff","doi":"10.4230/LIPIcs.TIME.2020.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.15","url":null,"abstract":"Real-time and distributed systems are increasingly finding their way into critical embedded systems. On one side, computations need to be achieved within specific time constraints. On the other side, computations may be spread among various units which are not necessarily sharing a global clock. \u0000Our study is focused on a specification language, named TESL, used for coordinating concurrent models with timed constraints. We explore various questions related to time when modeling systems, and aim at showing that TESL can be introduced as a reasonable balance of expressiveness and \u0000decidability to tackle issues in complex systems. This paper introduces (1) an overview of the TESL language and its main properties (polychrony, stutter-invariance, coinduction for simulation), (2) extensions to the language and their applications.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"15:1-15:15"},"PeriodicalIF":0.0,"publicationDate":"2020-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46433179","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
Negotiating Temporal Commitments in Cross-Organizational Business Processes 跨组织业务流程中的时间承诺谈判
Time Pub Date : 2020-09-15 DOI: 10.4230/LIPIcs.TIME.2020.4
M. Franceschetti, Johann Eder
{"title":"Negotiating Temporal Commitments in Cross-Organizational Business Processes","authors":"M. Franceschetti, Johann Eder","doi":"10.4230/LIPIcs.TIME.2020.4","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.4","url":null,"abstract":"Cross-organizational business processes emerge from the cooperation of intra-organizational business processes through exchange of messages. The involved parties agree on communication protocols, which contain in particular temporal constraints: as obligations on one hand, and as guarantees on the other hand. These constraints form also requirements for the design of the hidden implementation of the processes and are the basis for control decisions for each party. We present a comprehensive methodology for modeling the temporal aspects of cross-organizational business processes, checking dynamic controllability of such processes, and supporting the negotiation of temporal commitments. We do so by computing the consequences of temporal constraints in choreographies, and by computing the weakest preconditions for the dynamic controllability of a participating process. 2012 ACM Subject Classification Applied computing → Cross-organizational business processes","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"4:1-4:15"},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41355184","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
Cracking the Ice 打破僵局
Time Pub Date : 2020-03-06 DOI: 10.1215/9781478009047-004
{"title":"Cracking the Ice","authors":"","doi":"10.1215/9781478009047-004","DOIUrl":"https://doi.org/10.1215/9781478009047-004","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66039391","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
Blood work. 血的工作。
Time Pub Date : 2020-01-28 DOI: 10.2307/j.ctvw04c0s.34
Sanjay Gupta
{"title":"Blood work.","authors":"Sanjay Gupta","doi":"10.2307/j.ctvw04c0s.34","DOIUrl":"https://doi.org/10.2307/j.ctvw04c0s.34","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"166 14 1","pages":"92"},"PeriodicalIF":0.0,"publicationDate":"2020-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49153465","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
On the Decidability of a Fragment of preferential LTL 优先LTL片段的可判定性
Time Pub Date : 2020-01-01 DOI: 10.4230/LIPIcs.TIME.2020.19
Anasse Chafik, Fahima Cheikh, Jean-François Condotta, I. Varzinczak
{"title":"On the Decidability of a Fragment of preferential LTL","authors":"Anasse Chafik, Fahima Cheikh, Jean-François Condotta, I. Varzinczak","doi":"10.4230/LIPIcs.TIME.2020.19","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2020.19","url":null,"abstract":"14 Linear Temporal Logic (LTL) has found extensive applications in Computer Science and Artificial Intelligence, 15 notably as a formal framework for representing and verifying computer systems that vary over time. Non16 monotonic reasoning, on the other hand, allows us to formalize and reason with exceptions and the dynamics of 17 information. The goal of this paper is therefore to enrich temporal formalisms with non-monotonic reasoning 18 features. We do so by investigating a preferential semantics for defeasible LTL along the lines of that extensively 19 studied by Kraus et al. in the propositional case and recently extended to modal and description logics. The main 20 contribution of the paper is a decidability result for a meaningful fragment of preferential LTL that can serve as 21 the basis for further exploration of defeasibility in temporal formalisms. 22 2012 ACM Subject Classification Theory of computation → Modal and temporal logics 23","PeriodicalId":75226,"journal":{"name":"Time","volume":"182 1","pages":"19:1-19:19"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75071077","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书