2014 21st International Symposium on Temporal Representation and Reasoning最新文献

A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games 简单时间网络的可处理推广及其与平均收益对策的关系

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.19

Carlo Comin, Roberto Posenato, Romeo Rizzi

{"title":"A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games","authors":"Carlo Comin, Roberto Posenato, Romeo Rizzi","doi":"10.1109/TIME.2014.19","DOIUrl":"https://doi.org/10.1109/TIME.2014.19","url":null,"abstract":"Simple Temporal Networks (STNs) are used in many applications, as they provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. We introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints. In a Hyper Temporal Network a single temporal constraint may be defined as a set of two or more maximum delay constraints which is satisfied when at least one of these delay constraints is satisfied. As in STNs, a HyTN is consistent when a real value can be assigned to each temporal variable satisfying all the constraints. We show the computational complexity for this generalization and propose effective reduction algorithms for checking consistency of HyTNs unveiling the link with the field of Mean Payoff Games. HyTNs are meant as a light generalization of STNs offering an interesting compromise. On one side, as we show, there exist practical pseudo-polynomial time algorithms for checking consistency and computing feasible schedules for HyTNs. On the other side, HyTNs allow to express natural constraints that cannot be expressed by HySTNs like \"trigger off an event exactly d min after the occurrence of the last event in a set\".","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"58 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117171089","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}

引用次数: 14

A Formal Account of Planning with Flexible Timelines 灵活时间表计划的正式说明

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.27

M. C. Mayer, Andrea Orlandini, A. Umbrico

{"title":"A Formal Account of Planning with Flexible Timelines","authors":"M. C. Mayer, Andrea Orlandini, A. Umbrico","doi":"10.1109/TIME.2014.27","DOIUrl":"https://doi.org/10.1109/TIME.2014.27","url":null,"abstract":"Planning for real world problems with explicit temporal constraints is a challenging problem. Among several approaches, the use of flexible timelines in Planning and Scheduling (P&S) has demonstrated to be successful in a number of concrete applications, such as, for instance, autonomous space systems. A flexible timeline describes an envelope of possible solutions which can be exploited by an executive system for robust on-line execution. A remarkable research effort has been dedicated to design, build and deploy software environments, like EUROPA, ASPEN, and APSI-TRF, for the synthesis of timeline-based P&S applications. Several attempts have also been made to characterize the concept of timelines. Nevertheless, a formal characterization of flexible timelines and plans is still missing. This paper presents a formal account of flexible timelines aiming at providing a general semantics for related planning concepts such as domains, goals, problems, constraints and flexible plans. Some basic properties of the defined concepts are also stated and proved. A simple running example inspired by a real world planning domain is exploited to illustrate the proposed formal notions. Finally, a planning tool, called Extensible Planning and Scheduling Library (EPSL), is briefly presented, which is able to generate flexible plans that are compliant with the given semantics.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128682792","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}

引用次数: 19

Parametrized Verification Diagrams 参数化验证图

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.11

A. Sánchez, César Sánchez

{"title":"Parametrized Verification Diagrams","authors":"A. Sánchez, César Sánchez","doi":"10.1109/TIME.2014.11","DOIUrl":"https://doi.org/10.1109/TIME.2014.11","url":null,"abstract":"This paper introduces parametrized verification diagrams (PVDs), a formalism that allows to prove temporal properties of parametrized concurrent systems, in which a given program is executed by an unbounded number of processes. PVDs extend general verification diagrams (GVDs). GVDs encode succinctly a proof that a non-parametrized reactive system satisfies a given temporal property. Even though GVDs are known to be sound and complete for non-parametrized systems, proving temporal properties of parametrized systems potentially requires to find a different diagram for each instantiation of the parameter (number of processes). In turn, each diagram requires to discharge and prove a different collection of verification conditions. PVDs allow a single diagram to represent the proof that all instances of the parametrized system for an arbitrary number of threads running concurrently satisfy the temporal specification. Checking the proof represented by a PVD requires proving only a finite collection of quantifier-free verification conditions. The PVDs we present here exploit the symmetry assumption, under which process identifiers are interchangeable. This assumption covers a large class of concurrent systems, including concurrent datatypes. We illustrate the use of PVDs in the verification of an infinite state mutual exclusion protocol.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130167514","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}

引用次数: 8

High-Level Operations for Creation and Maintenance of Temporal and Conventional Schema in the tauXSchema Framework tauXSchema框架中用于创建和维护临时模式和常规模式的高级操作

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.14

Zouhaier Brahmia, F. Grandi, Barbara Oliboni, R. Bouaziz

{"title":"High-Level Operations for Creation and Maintenance of Temporal and Conventional Schema in the tauXSchema Framework","authors":"Zouhaier Brahmia, F. Grandi, Barbara Oliboni, R. Bouaziz","doi":"10.1109/TIME.2014.14","DOIUrl":"https://doi.org/10.1109/TIME.2014.14","url":null,"abstract":"Tauxschema is a framework for constructing and validating time-varying XML documents through the use of a temporal schema. This latter ties together a conventional schema (i.e., A standard XML Schema document) and its corresponding logical and physical annotations, which are stored in an annotation document. Conventional schema and logical and physical annotations undergo changes to respond to changes in user requirements or in the real-world. Consequently, the corresponding temporal schema is also evolving over time. In this paper, we study operations which help designers for changing such schema components. Indeed, we propose three sets of high-level operations for changing temporal schema, conventional schema, and annotations. These high-level operations are based on the low-level operations proposed in our previous work [11, 12, 14, 15, 16]. They are also consistency preserving and more user-friendly than the low-level operations. Besides, we have divided the proposed operations into basic high-level operations (i.e., High-level operations that cannot be defined by using other basic high-level operations) and complex ones.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123206020","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}

引用次数: 7

Fairness with EXPTIME Bundled CTL Tableau 公平与EXPTIME捆绑CTL表

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.22

J. McCabe-Dansted, M. Reynolds

引用次数: 3

Verification of Rewrite Rules for Computation Tree Logics 计算树逻辑重写规则的验证

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.25

J. McCabe-Dansted, M. Reynolds

引用次数: 2

A Framework for Managing Temporal Dimensions in Archaeological Data 考古数据中时间维度管理的框架

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.15

A. Belussi, S. Migliorini

{"title":"A Framework for Managing Temporal Dimensions in Archaeological Data","authors":"A. Belussi, S. Migliorini","doi":"10.1109/TIME.2014.15","DOIUrl":"https://doi.org/10.1109/TIME.2014.15","url":null,"abstract":"Time and space are two important characteristics of archaeological data. As regards to the first aspect, in literature many time dimensions for archaeology have been defined which extend from the excavation time, to the dating of archaeological objects. Standard ISO 19018 describes temporal characteristics of geographical information in terms of both geometric and topological primitives. The first aim of this paper is to analyze the applicability of such Standard for representing archaeological data, referring to the model adopted by the city of Verona (Italy) as case study. However, since archaeological dates are often subjective, estimated and imprecise, one of the main lack in the Standard is the inability to incorporate such vagueness in date representation. Therefore, the second contribution of this paper is the extension of the Standard in order to represent fuzzy dates and fuzzy relationships among them. Finally, considering the process through which objects are usually manually dated by archeologists, some existing automatic techniques for time reasoning may be successfully applied in this context in order to guide the dating process. For this purpose, the last paper contribution regards the translation of some archaeological temporal data into a Fuzzy Temporal Constraint Network (FTCN) for checking the overall data consistency and reducing the vagueness of some dates based on their relationships with other ones.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134245284","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}

引用次数: 14

Approximate Interval-Based Temporal Dependencies: The Complexity Landscape 基于近似间隔的时间依赖性:复杂性景观

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.20

P. Sala

{"title":"Approximate Interval-Based Temporal Dependencies: The Complexity Landscape","authors":"P. Sala","doi":"10.1109/TIME.2014.20","DOIUrl":"https://doi.org/10.1109/TIME.2014.20","url":null,"abstract":"Temporal functional dependencies (TFDs) add valid time to classical functional dependencies (FDs) in order to express data integrity constraints over the flow of time. If the temporal dimension adopted is an interval, we have to deal with interval-based temporal functional dependencies (ITFDs for short), which consider different interval relations between valid times of related tuples. The related approximate problem is when we want to check if our data satisfy, without any constraint for the schema, a given ITFD under a given error threshold 0 ≤ d ≤ 1. This can be rephrased as: given a relation instance r, is it possible to delete at most c · |r| tuples from it in such a way that the resulting instance satisfies the given ITFD? This optimization problem, ITFD-Approx for short, may represent a way to discover (data mining) important dependencies among attribute values in a database as well as a way to control data consistency. In this paper we analyze the complexity of problem ITFD-Approx restricting ourselves to Allen's interval relations: we will see how the complexity of such a problem may significantly change, depending on the considered interval relation.","PeriodicalId":309715,"journal":{"name":"2014 21st International Symposium on Temporal Representation and Reasoning","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125468389","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

Quantitative Verification in Rational Environments Rational环境中的定量验证

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.9

Anshul Gupta, S. Schewe

引用次数: 12

Summarizability in Multiversion Data Warehouse 多版本数据仓库中的摘要性

2014 21st International Symposium on Temporal Representation and Reasoning Pub Date : 2014-11-03 DOI: 10.1109/TIME.2014.12

I. Turki, Faïza Ghozzi, R. Bouaziz

引用次数: 0