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

Time最新文献

筛选
英文 中文
Two-Dimensional Rule Language for Querying Sensor Log Data: A Framework and Use Cases 传感器日志数据查询的二维规则语言:框架和用例
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.7
S. Brandt, Diego Calvanese, E. G. Kalayci, R. Kontchakov, Benjamin Mörzinger, V. Ryzhikov, Guohui Xiao, M. Zakharyaschev
{"title":"Two-Dimensional Rule Language for Querying Sensor Log Data: A Framework and Use Cases","authors":"S. Brandt, Diego Calvanese, E. G. Kalayci, R. Kontchakov, Benjamin Mörzinger, V. Ryzhikov, Guohui Xiao, M. Zakharyaschev","doi":"10.4230/LIPIcs.TIME.2019.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.7","url":null,"abstract":"Motivated by two industrial use cases that involve detecting events of interest in (asynchronous) time series from sensors in manufacturing rigs and gas turbines, we design an expressive rule language DslD equipped with interval aggregate functions (such as weighted average over a time interval), Allen’s interval relations and various metric constructs. We demonstrate how to model events in the uses cases in terms of DslD programs. We show that answering DslD queries in our use cases can be reduced to evaluating SQL queries. Our experiments with the use cases, carried out on the Apache Spark system, show that such SQL queries scale well on large real-world datasets. 2012 ACM Subject Classification Computing methodologies → Ontology engineering; Computing methodologies → Temporal reasoning; Theory of computation → Modal and temporal logics","PeriodicalId":75226,"journal":{"name":"Time","volume":"59 4 1","pages":"7:1-7:15"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77314105","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
The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations 二级交通罚款:欧洲交通法规的时间推理
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.6
Ana de Almeida Borges, Juan José Conejero Rodríguez, D. Fernández-Duque, Mireia González Bedmar, J. Joosten
{"title":"The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations","authors":"Ana de Almeida Borges, Juan José Conejero Rodríguez, D. Fernández-Duque, Mireia González Bedmar, J. Joosten","doi":"10.4230/LIPIcs.TIME.2019.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.6","url":null,"abstract":"We argue that European transport regulations can be formalized within the Σ 11 fragment of monadic second order logic, and possibly weaker fragments including linear temporal logic. We consider several articles in the regulation to verify these claims. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics; Theory of → Higher","PeriodicalId":75226,"journal":{"name":"Time","volume":"86 1","pages":"6:1-6:16"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77631242","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
Simplifying Inductive Schemes in Temporal Logic 简化时间逻辑中的归纳方案
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.19
P. Cordero, I. Fortes, I. Guzmán, Sixto Sánchez
{"title":"Simplifying Inductive Schemes in Temporal Logic","authors":"P. Cordero, I. Fortes, I. Guzmán, Sixto Sánchez","doi":"10.4230/LIPIcs.TIME.2019.19","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.19","url":null,"abstract":"In propositional temporal logic, the combination of the connectives “tomorrow” and “always in the future” require the use of induction tools. In this paper, we present a classification of inductive schemes for propositional linear temporal logic that allows the detection of loops in decision procedures. In the design of automatic theorem provers, these schemes are responsible for the searching of efficient solutions for the detection and management of loops. We study which of these schemes have a good behavior in order to give a set of reduction rules that allow us to compute these schemes efficiently and, therefore, be able to eliminate these loops. These reduction laws can be applied previously and during the execution of any automatic theorem prover. All the reductions introduced in this paper can be considered a part of the process for obtaining a normal form of a given formula. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics","PeriodicalId":75226,"journal":{"name":"Time","volume":"41 1","pages":"19:1-19:13"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81350805","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
On the Computation of Nash Equilibria in Games on Graphs (Invited Talk) 论图上博弈纳什均衡的计算(特邀演讲)
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.3
P. Bouyer
{"title":"On the Computation of Nash Equilibria in Games on Graphs (Invited Talk)","authors":"P. Bouyer","doi":"10.4230/LIPIcs.TIME.2019.3","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.3","url":null,"abstract":"In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games played on graphs. I will present in particular a construction, called the suspect game construction, which allows to reduce the computation of Nash equilibria to the computation of winning strategies in a two-player zero-sum game. 2012 ACM Subject Classification Theory of computation; Theory of computation → Solution concepts in game theory; Theory of computation → Verification by model checking","PeriodicalId":75226,"journal":{"name":"Time","volume":"53 1","pages":"3:1-3:3"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80160415","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
On Temporal and Separation Logics (Invited Paper) 论时间逻辑与分离逻辑（特邀论文）
Time Pub Date : 2018-10-15 DOI: 10.4230/LIPIcs.TIME.2018.1
Stephane Demri
{"title":"On Temporal and Separation Logics (Invited Paper)","authors":"Stephane Demri","doi":"10.4230/LIPIcs.TIME.2018.1","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.1","url":null,"abstract":"There exist many success stories about the introduction of logics designed for the formal verification of computer systems. Obviously, the introduction of temporal logics to computer science has been a major step in the development of model-checking techniques. More recently, separation logics extend Hoare logic for reasoning about programs with dynamic data structures, leading to many contributions on theory, tools and applications. In this talk, we illustrate how several features of separation logics, for instance the key concept of separation, are related to similar notions in temporal logics. We provide formal correspondences (when possible) and present an overview of related works from the literature. This is also the opportunity to present bridges between well-known temporal logics and more recent separation logics.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"1:1-1:4"},"PeriodicalIF":0.0,"publicationDate":"2018-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45911745","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
Database Technology for Processing Temporal Data (Invited Paper) 处理时态数据的数据库技术(特邀论文)
Time Pub Date : 2018-10-01 DOI: 10.4230/LIPIcs.TIME.2018.2
Michael H. Böhlen, Anton Dignös, J. Gamper, Christian S. Jensen
{"title":"Database Technology for Processing Temporal Data (Invited Paper)","authors":"Michael H. Böhlen, Anton Dignös, J. Gamper, Christian S. Jensen","doi":"10.4230/LIPIcs.TIME.2018.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.2","url":null,"abstract":": Despite the ubiquity of temporal data and considerable research on processing such data, database systems largely remain designed for processing the current state of some modeled reality. More recently, we have seen an increasing interest in processing historical or temporal data. The SQL:2011 standard introduced some temporal features, and commercial database management systems have started to offer temporal functionalities in a step-by-step manner. There has also been a proposal for a more fundamental and comprehensive solution for sequenced temporal queries, which allows a tight integration into relational database systems, thereby taking advantage of existing query optimization and evaluation technologies. New challenges for processing temporal data arise with multiple dimensions of time and the increasing amounts of data, including time series data that represent a special kind of temporal data. Abstract Despite the ubiquity of temporal data and considerable research on processing such data, database systems largely remain designed for processing the current state of some modeled reality. More recently, we have seen an increasing interest in processing historical or temporal data. The SQL:2011 standard introduced some temporal features, and commercial database management systems have started to offer temporal functionalities in a step-by-step manner. There has also been a proposal for a more fundamental and comprehensive solution for sequenced temporal queries, which allows a tight integration into relational database systems, thereby taking advantage of existing query optimization and evaluation technologies. New challenges for processing temporal data arise with multiple dimensions of time and the increasing amounts of data, including time series data that represent a special kind of temporal data.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"2:1-2:7"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43203885","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
A Temporal Logic for Modelling Activities of Daily Living 日常生活活动建模的时间逻辑
Time Pub Date : 2018-10-01 DOI: 10.4230/LIPIcs.TIME.2018.17
Malte S. Kliess, C. Jonker, M. Riemsdijk
{"title":"A Temporal Logic for Modelling Activities of Daily Living","authors":"Malte S. Kliess, C. Jonker, M. Riemsdijk","doi":"10.4230/LIPIcs.TIME.2018.17","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.17","url":null,"abstract":"Behaviour support technology is aimed at assisting people in organizing their Activities of Daily Living (ADLs). Numerous frameworks have been developed for activity recognition and for generating specific types of support actions, such as reminders. The main goal of our research is to develop a generic formal framework for representing and reasoning about ADLs and their temporal relations. This framework should facilitate modelling and reasoning about 1) durative activities, 2) relations between higher-level activities and subactivities, 3) activity instances, and 4) activity duration. In this paper we present a temporal logic as an extension of the logic TPTL for specification of real-time systems. Our logic TPTLbih is defined over Behaviour Identification Hierarchies (BIHs) for representing ADL structure and typical activity duration. To model execution of ADLs, states of the temporal traces in TPTLbih comprise information about the start, stop and current execution of activities. We provide a number of constraints on these traces that we stipulate are desired for the accurate representation of ADL execution, and investigate corresponding validities in the logic. To evaluate the expressivity of the logic, we give a formal definition for the notion of Coherence for (complex) activities, by which we mean that an activity is done without interruption and in a timely fashion. We show that the definition is satisfiable in our framework. In this way the logic forms the basis for a generic monitoring and reasoning framework for ADLs.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"17:1-17:15"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48436638","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
Population Based Methods for Optimising Infinite Behaviours of Timed Automata 基于种群的时间自动机无限行为优化方法
Time Pub Date : 2018-09-26 DOI: 10.4230/LIPIcs.TIME.2018.22
Lewis Tolonen, T. French, Mark Reynolds
{"title":"Population Based Methods for Optimising Infinite Behaviours of Timed Automata","authors":"Lewis Tolonen, T. French, Mark Reynolds","doi":"10.4230/LIPIcs.TIME.2018.22","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.22","url":null,"abstract":"Timed automata are powerful models for the analysis of real time systems. The optimal infinite scheduling problem for double-priced timed automata is concerned with finding infinite runs of a system whose long term cost to reward ratio is minimal. Due to the state-space explosion occurring when discretising a timed automaton, exact computation of the optimal infinite ratio is infeasible. This paper describes the implementation and evaluation of ant colony optimisation for approximating the optimal schedule for a given double-priced timed automaton. The application of ant colony optimisation to the corner-point abstraction of the automaton proved generally less effective than a random method. The best found optimisation method was obtained by formulating the choice of time delays in a cycle of the automaton as a linear program and utilizing ant colony optimisation in order to determine a sequence of profitable discrete transitions comprising an infinite behaviour. 2012 ACM Subject Classification Theory of computation → Automata over infinite objects","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"22:1-22:22"},"PeriodicalIF":0.0,"publicationDate":"2018-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49382412","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
Cool Running 酷跑
Time Pub Date : 2018-08-01 DOI: 10.12968/s0261-2097(23)60044-9
{"title":"Cool Running","authors":"","doi":"10.12968/s0261-2097(23)60044-9","DOIUrl":"https://doi.org/10.12968/s0261-2097(23)60044-9","url":null,"abstract":"In the race to have the most efficient, lightweight electric motor for future vehicles, Equipmake says the unique cooling technology in its spoke motor marks it out as a world leader. Tom Austin-Morgan reports.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66272646","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 game-theoretic approach to timeline-based planning with uncertainty 不确定性时程规划的博弈论方法
Time Pub Date : 2018-07-12 DOI: 10.4230/LIPIcs.TIME.2018.13
N. Gigante, A. Montanari, M. C. Mayer, Andrea Orlandini, Mark Reynolds
{"title":"A game-theoretic approach to timeline-based planning with uncertainty","authors":"N. Gigante, A. Montanari, M. C. Mayer, Andrea Orlandini, Mark Reynolds","doi":"10.4230/LIPIcs.TIME.2018.13","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.13","url":null,"abstract":"In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temporal constraints. A distinguishing feature of timeline-based planning systems is the ability to integrate planning with execution by synthesising control strategies for flexible plans. However, flexible plans can only represent temporal uncertainty, while more complex forms of nondeterminism are needed to deal with a wider range of realistic problems. In this paper, we propose a novel game-theoretic approach to timeline-based planning problems, generalising the state of the art while uniformly handling temporal uncertainty and nondeterminism. We define a general concept of timeline-based game and we show that the notion of winning strategy for these games is strictly more general than that of control strategy for dynamically controllable flexible plans. Moreover, we show that the problem of establishing the existence of such winning strategies is decidable using a doubly exponential amount of space.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"13:1-13:17"},"PeriodicalIF":0.0,"publicationDate":"2018-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45897344","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学术官方微信