{"title":"Temporal query languages expressive power: /spl mu/TL vs. T-WHILE","authors":"N. Bidoit, M. Objois","doi":"10.1109/TIME.2005.35","DOIUrl":"https://doi.org/10.1109/TIME.2005.35","url":null,"abstract":"We investigate the expressive power of implicit temporal query languages. The initial motivation was refining the results of (S. Abiteboul et al., 1999) and enrich them with comparison to /spl mu/TL (M.Y. Vardi, 1988). Thus, we address two classes of temporal query languages: /spl mu/TL-like languages based on TL and T-WHILE-like languages based on WHILE. We provide a two-level hierarchy (w.r t. expressive power) for these temporal query languages. One of the contributions solves an open problem: the relative expressivity of /spl mu/TL and T-FIXPOINT.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131511077","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}
{"title":"Temporal XML? SQL strikes back!","authors":"Fusheng Wang, C. Zaniolo, Xin Zhou","doi":"10.1109/TIME.2005.36","DOIUrl":"https://doi.org/10.1109/TIME.2005.36","url":null,"abstract":"While the introduction of temporal extensions into database standards has proven difficult to achieve, the newly introduced SQL:2003 and XML/XQuery standards have actually enhanced our ability to support temporal applications in commercial database systems. We illustrate this point by discussing three approaches that use temporally grouped representations. We first compare the approaches at the logical level using a common set of queries; then we turn to the physical level and discuss our ArchIS system that supports the three different approaches efficiently in one unified physical implementation. We conclude that the approaches of managing transaction-time information using XML and SQL can be integrated and supported efficiently within the current standards, and claim that the proposed approach can be extended to valid-time and bitemporal databases.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115544457","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}
{"title":"An XML-based framework for temporal database implementation","authors":"S. Noh, S. Gadia","doi":"10.1109/TIME.2005.12","DOIUrl":"https://doi.org/10.1109/TIME.2005.12","url":null,"abstract":"This paper presents an XML-based approach to implementing the parametric model of temporal databases. In the parametric model, attribute values are functions of time and the entire history of an object is modeled in terms of a single tuple. This property makes it difficult to adapt the parametric model within the conventional databases. However, XML is an attractive option for implementation because data boundaries are not problematic in XML. Native XML storage with pagination is used for storing temporal data and the DOM parser for the paginated XML storage is used for data access. The primitives for the query language are implemented using the DOM parser. Many artifacts, such as parse tree and expression tree are also represented in XML. We hope that this paradigm offers an elegant approach for implementation of complex data models.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114220136","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}
{"title":"Analysis of timed processes with data using algebraic transformations","authors":"M. Reniers, Y. Usenko","doi":"10.1109/TIME.2005.13","DOIUrl":"https://doi.org/10.1109/TIME.2005.13","url":null,"abstract":"In this paper, we outline a method to describe and analyze real-time systems using timed /spl mu/CRL. Most descriptions of such systems contain operators such as parallel composition that complicate analysis. As a first step towards the analysis of such systems, we linearize the given description using the algorithm from the work of Usenko (2002). The result is a timed linear process equation (TLPE) which is equivalent to the original description and has a very simple structure. Next, we outline how a TLPE can be transformed into an LPE, i.e., a linear process equation without time. This transformation, called time-free abstraction, has been used for non-recursive timed /spl mu/CRL processes in the work of Rieners et al. (2002). Crucial for this transformation is that the TLPE is transformed into a well-timed TLPE. Finally, all time-stamping is captured in the parameters of atomic actions. The result is an LPE for which the machinery of untimed /spl mu/CRL can be put to use for further analysis. These are based on symbolic analysis of the specifications, such as invariants, term rewriting and theorem proving, or on explicit state space generation and model-checking.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116095116","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}
{"title":"Indexing inventory snapshots","authors":"B. Salzberg","doi":"10.1109/TIME.2005.25","DOIUrl":"https://doi.org/10.1109/TIME.2005.25","url":null,"abstract":"Summary form only given. Inventory snapshots tell us what was on the shelves of a store at a given moment in time. In this article, an indexing structure that could efficiently capture the inventory at any past time was outlined, the time splitting data structure. It keeps both storage costs and snapshot query costs low.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122702590","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}
{"title":"Specification patterns for time-related properties","authors":"V. Gruhn, R. Laue","doi":"10.1109/TIME.2005.33","DOIUrl":"https://doi.org/10.1109/TIME.2005.33","url":null,"abstract":"We present a pattern system for property specification. It extends the existing patterns identified by M.B. Dwyer, G.S. Avrunin, and J.C. Corbett (1998) which allow to reason about occurrence and order of events, but not about time conditions. Introducing time-related patterns allows the specification of real-time requirements.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131902781","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}
{"title":"A local method for prioritized fusion of temporal information","authors":"Mahat Khelfallah, B. Benhamou","doi":"10.1109/TIME.2005.7","DOIUrl":"https://doi.org/10.1109/TIME.2005.7","url":null,"abstract":"Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation consists in restoring the consistency of the merged information by changing a minimum of the initial information. In this paper, we are interested in linear constraints prioritized fusion in the framework of simple temporal problems (STPs). Priority expresses a preference relation between linear constraints and can represent either confidence or quality degrees of the constraints, or the reliability of their sources. We propose a local fusion method which we experiment on random prioritized STP instances.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133957047","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}
{"title":"Quantitative temporal logics: PSpace and below","authors":"C. Lutz, Dirk Walther, F. Wolter","doi":"10.1109/TIME.2005.31","DOIUrl":"https://doi.org/10.1109/TIME.2005.31","url":null,"abstract":"Often, the addition of metric operators to qualitative temporal logics leads to an increase of the complexity of satisfiability by at least one exponential. In this paper, we exhibit a number of metric extensions of qualitative temporal logics of the real line that do not lead to an increase in computational complexity. We show that the language obtained by extending since/until logic of the real line with the operators 'sometime within n time units', n coded in binary, is PSpace-complete even without the finite variability assumption. Without qualitative temporal operators the complexity of this language turns out to depend on whether binary or unary coding of parameters is assumed: it is still PSpace-hard under binary coding but in NP under unary coding.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132926475","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}
{"title":"Probabilistic calculation of execution intervals for workflows","authors":"Johann Eder, H. Pichler","doi":"10.1109/TIME.2005.29","DOIUrl":"https://doi.org/10.1109/TIME.2005.29","url":null,"abstract":"The comprehensive treatment of time and time constraints is crucial in designing and managing business processes. Process managers need tools that help them predict execution durations, anticipate time problems, pro-actively avoid time constraint violations, and make decisions about the relative process priorities and timing constraints when significant or unexpected delays occur. Variations of activity durations and branching decisions at run-time make it necessary that we treat time management in workflows in a probabilistic way. Therefore we introduce the notion of probabilistic time management and discuss the application of this new concept for workflow design as well as time aware, predictive and proactive workflow execution management.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133337523","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}
{"title":"Efficient rectangle indexing algorithms based on point dominance","authors":"P. Revesz","doi":"10.1109/TIME.2005.21","DOIUrl":"https://doi.org/10.1109/TIME.2005.21","url":null,"abstract":"An approximate count of the number of (1) k-dimensional rectangles that contain, overlap or are within a query rectangle Q, and (2) linearly moving points that are to the left of a moving query point Q on the x-axis at time t, can be found in (poly)-logarithmic time in the number of rectangles or moving points.","PeriodicalId":353250,"journal":{"name":"12th International Symposium on Temporal Representation and Reasoning (TIME'05)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132107976","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}