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

Time最新文献

筛选
英文 中文
Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker 过往事项:支持LTL+过往满意度检查
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.8
Luca Geatti, N. Gigante, A. Montanari, Gabriele Venturato
{"title":"Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker","authors":"Luca Geatti, N. Gigante, A. Montanari, Gabriele Venturato","doi":"10.4230/LIPIcs.TIME.2021.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.8","url":null,"abstract":"LTL+Past is the extension of Linear Temporal Logic (LTL) supporting past temporal operators. The addition of the past does not add expressive power, but does increase the usability of the language both in formal verification and in artificial intelligence, e.g., in the context of multi-agent systems. In this paper, we add the support of past operators to BLACK, a satisfiability checker for LTL based on a SAT encoding of a tree-shaped tableau system. We implement two ways of supporting the past in the tool. The first one is an equisatisfiable translation that removes the past operators, obtaining a future-only formula that can be solved with the original LTL engine. The second one extends the SAT encoding of the underlying tableau to directly support the tableau rules that deal with past operators. We describe both approaches and experimentally compare the two between themselves and with the nuXmv model checker, obtaining promising results. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics","PeriodicalId":75226,"journal":{"name":"Time","volume":"26 1","pages":"8:1-8:17"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90522233","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
Extreme-Scale Model-Based Time Series Management with ModelarDB (Invited Talk) 基于ModelarDB的极端尺度模型时间序列管理(特邀演讲)
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.2
T. Pedersen
{"title":"Extreme-Scale Model-Based Time Series Management with ModelarDB (Invited Talk)","authors":"T. Pedersen","doi":"10.4230/LIPIcs.TIME.2021.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.2","url":null,"abstract":"To monitor critical industrial devices such as wind turbines, high quality sensors sampled at a high frequency are increasingly used. Current technology does not handle these extreme-scale time series well [1], so only simple aggregates are traditionally stored, removing outliers and fluctuations that could indicate problems. As a remedy, we present a model-based approach for managing extremescale time series that approximates the time series values using mathematical functions (models) and stores only model coefficients rather than data values. Compression is done both for individual time series and for correlated groups of time series. The keynote will present concepts, techniques, and algorithms from model-based time series management and our implementation of these in the open source Time Series Management System (TSMS) ModelarDB[2, 3, 4] 1. Furthermore, it will present our experimental evaluation of ModelarDB on extreme-scale real-world time series, which shows that that compared to widely used Big Data formats, ModelarDB provides up to 14× faster ingestion due to high compression, 113× better compression due to its adaptability, 573× faster aggregatation by using models, and close to linear scale-out scalability. ModelarDB is being commercialized by the spin-out company ModelarData2. 2012 ACM Subject Classification Information systems → Data management systems","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"2:1-2:2"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89934362","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
Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic 线性时序逻辑中本体中介查询fo -可重写性的决定
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.10
V. Ryzhikov, Yury Savateev, M. Zakharyaschev
{"title":"Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic","authors":"V. Ryzhikov, Yury Savateev, M. Zakharyaschev","doi":"10.4230/LIPIcs.TIME.2021.10","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.10","url":null,"abstract":"11 Our concern is the problem of determining the data complexity of answering an ontology-mediated 12 query (OMQ) given in linear temporal logic LTL over ( Z , < ) and deciding whether it is rewritable to an 13 FO ( < )-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity 14 and FO-definability of regular languages, OMQ answering in AC 0 , ACC 0 and NC 1 coincides 15 with FO ( <, ≡ )-rewritability using unary predicates x ≡ 0 (mod n ), FO ( <, MOD )-rewritability, and 16 FO ( RPR )-rewritability using relational primitive recursion, respectively. We then show that deciding 17 FO ( < )-, FO ( <, ≡ )- and FO ( <, MOD )-rewritability of LTL OMQs is ExpSpace -complete, and that 18 these problems become PSpace -complete for OMQs with a linear Horn ontology and an atomic 19 query, and also a positive query in the cases of FO ( < )- and FO ( <, ≡ )-rewritability. Further, we 20 consider FO ( < )-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for 21 which deciding it is PSpace -, Π p 2 - and coNP -complete. 22","PeriodicalId":75226,"journal":{"name":"Time","volume":"49 1","pages":"10:1-10:15"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81638264","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
A Neuro-Symbolic Approach to Structured Event Recognition 结构化事件识别的神经符号方法
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.11
Gianluca Apriceno, Andrea Passerini, L. Serafini
{"title":"A Neuro-Symbolic Approach to Structured Event Recognition","authors":"Gianluca Apriceno, Andrea Passerini, L. Serafini","doi":"10.4230/LIPIcs.TIME.2021.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.11","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"15 1","pages":"11:1-11:14"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82341120","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
Model Checking Timed Recursive CTL 模型检查定时递归CTL
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.12
Florian Bruse, Martin Lange
{"title":"Model Checking Timed Recursive CTL","authors":"Florian Bruse, Martin Lange","doi":"10.4230/LIPIcs.TIME.2021.12","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.12","url":null,"abstract":"We introduce Timed Recursive CTL, a merger of two extensions of the well-known branching-time logic CTL: Timed CTL is interpreted over real-time systems like timed automata; Recursive CTL introduces a powerful recursion operator which takes the expressiveness of this logic CTL well beyond that of regular properties. The result is an expressive logic for real-time properties. We show that its model checking problem is decidable over timed automata, namely 2-EXPTIME-complete. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics; Theory of computation → Program specifications","PeriodicalId":75226,"journal":{"name":"Time","volume":"55 1","pages":"12:1-12:14"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78088540","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
Temporal Big Data Analytics: New Frontiers for Big Data Analytics Research (Panel Description) 时间大数据分析:大数据分析研究的新领域(小组介绍)
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.4
A. Cuzzocrea
{"title":"Temporal Big Data Analytics: New Frontiers for Big Data Analytics Research (Panel Description)","authors":"A. Cuzzocrea","doi":"10.4230/LIPIcs.TIME.2021.4","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.4","url":null,"abstract":"Big data analytics is an emerging research area with many sophisticated contributions in the actual literature. Big data analytics aims at discovering actionable knowledge from large amounts of big data repositories, based on several approaches that integrate foundations of a wide spectrum of disciplines, ranging from data mining to machine learning and artificial intelligence. Among the concrete innovative topics of big data analytics, temporal big data analytics covers a first-class role and it is attracting the attention of larger and larger communities of academic and industrial researchers. Basically, temporal big data analytics aims at modeling, capturing and analyzing temporal aspects of big data during analytics phase, including specialized tasks such as big data versioning over time, building temporal relations among ad-hoc big data structures (such as nodes of big graphs) and temporal queries over big data. It is worth to notice that temporal big data analytics research is characterized by several open challenges, which range from foundations, including temporal big data representation and processing, to applications, including smart cities and bio-informatics tools. Inspired by these considerations, this paper focuses on models, paradigms, techniques and future challenges of temporal big data analytics, by reporting on state-of-the-art results as well as emerging trends, with also criticisms on future work that we should expect from the community. 2012 ACM Subject Classification Information systems → Temporal data; Information systems → Data analytics","PeriodicalId":75226,"journal":{"name":"Time","volume":"48 1","pages":"4:1-4:7"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76745788","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
Kernel Machines in Time (Invited Talk) Kernel Machines in Time(特邀演讲)
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.3
J. Suykens
{"title":"Kernel Machines in Time (Invited Talk)","authors":"J. Suykens","doi":"10.4230/LIPIcs.TIME.2021.3","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.3","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"37 1","pages":"3:1-3:1"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84532162","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
1½-Player Stochastic StopWatch Games 1½-玩家随机秒表游戏
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.17
S. Roychowdhury
{"title":"1½-Player Stochastic StopWatch Games","authors":"S. Roychowdhury","doi":"10.4230/LIPIcs.TIME.2021.17","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.17","url":null,"abstract":"Stochastic timed games (STGs), introduced by Bouyer and Forejt, generalize continuous-time Markov chains and timed automata. Depending on the number of players – 2, 1, or 0 – subclasses of stochastic timed games are classified as 2 2 -player, 1 1 2 -player, and 1 2 -player games where the 1 2 symbolizes the presence of the stochastic player. The qualitative and quantitative reachability problem for STGs was studied in [10] and [1]. In this paper, we introduce stochastic stopwatch games (SSG), an extension of (STG) from clocks to stopwatches. We focus on 1 2 -player SSGs and prove that with two variables which can be either a clock or a stopwatch, qualitative reachability is decidable, whereas, if we increase the number of variables to three, with at least one stopwatch, the problem becomes undecidable. 2012 ACM Subject Classification Theory of computation → Timed and hybrid models","PeriodicalId":75226,"journal":{"name":"Time","volume":"30 1","pages":"17:1-17:18"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79816274","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
Model Checking of Stream Processing Pipelines 流处理管道的模型检验
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.5
Alexis Bédard, Sylvain Hallé
{"title":"Model Checking of Stream Processing Pipelines","authors":"Alexis Bédard, Sylvain Hallé","doi":"10.4230/LIPIcs.TIME.2021.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.5","url":null,"abstract":"Event stream processing (ESP) is the application of a computation to a set of input sequences of arbitrary data objects, called “events”, in order to produce other sequences of data objects. In recent years, a large number of ESP systems have been developed; however, none of them is easily amenable to a formal verification of properties on their execution. In this paper, we show how stream processing pipelines built with an existing ESP library called BeepBeep 3 can be exported as a Kripke structure for the NuXmv model checker. This makes it possible to formally verify properties on these pipelines, and opens the way to the use of such pipelines directly within a model checker as an extension of its specification language. 2012 ACM Subject Classification Theory of computation → Streaming models","PeriodicalId":75226,"journal":{"name":"Time","volume":"18 1","pages":"5:1-5:17"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86196244","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
首页 上一页 下一页 尾页
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学术官方微信