2014 21st International Symposium on Temporal Representation and Reasoning

8-10 Sept. 2014

Filter Results

Displaying Results 1 - 25 of 30
  • [Front cover]

    Publication Year: 2014, Page(s): C4
    Request permission for reuse | PDF file iconPDF (1447 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2014, Page(s): i
    Request permission for reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2014, Page(s): iii
    Request permission for reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2014, Page(s): iv
    Request permission for reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2014, Page(s):v - vi
    Request permission for reuse | PDF file iconPDF (127 KB)
    Freely Available from IEEE
  • Message from the Program Chairs

    Publication Year: 2014, Page(s): vii
    Request permission for reuse | PDF file iconPDF (36 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committees

    Publication Year: 2014, Page(s): viii
    Request permission for reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2014, Page(s): ix
    Request permission for reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Additional Reviewers

    Publication Year: 2014, Page(s): x
    Request permission for reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Formal Methods for Dynamical Systems

    Publication Year: 2014, Page(s): 3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (123 KB) | HTML iconHTML

    In control theory, "complex" models of physical processes, such as systems of differential equations, are usually checked against "simple" specifications, such as stability and set invariance. In formal methods, "rich" specifications, such as languages and formulae of temporal logics, are checked against "simple" models of software programs and digital circuits, such as finite transition graphs. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advances in Symbolic Model Checking for Multi-agent Systems

    Publication Year: 2014, Page(s): 4
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (131 KB) | HTML iconHTML

    In this article, MAS symbolic verification against temporal-epistemic specifications was discussed. A further recent development concerns the verification of open MAS where the number of agents is unbounded at design time. In this setting sufficient conditions can be given for the establishment of cutoffs in MAS. A cut-off is the maximal number of agents that need to be considered to draw conclusi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games

    Publication Year: 2014, Page(s):7 - 16
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental Dynamic Controllability in Cubic Worst-Case Time

    Publication Year: 2014, Page(s):17 - 26
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    It is generally hard to predict the exact duration of an action. Uncertainty in durations is often modeled in temporal planning by the use of upper bounds on durations, with the assumption that if an action happens to be executed more quickly, the plan will still succeed. However, this assumption is often false: If we finish cooking too early, the dinner will be cold before everyone is ready to ea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation

    Publication Year: 2014, Page(s):27 - 36
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (430 KB) | HTML iconHTML

    Temporal networks are data structures for representing and reasoning about temporal constraints on activities. Many kinds of temporal networks have been defined in the literature, differing in their expressiveness. The simplest kinds of networks have polynomial algorithms for determining their consistency or controllability, but corresponding algorithms for more expressive networks (e.g., Those th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Formal Account of Planning with Flexible Timelines

    Publication Year: 2014, Page(s):37 - 46
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    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 b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metric Propositional Neighborhood Logic with an Equivalence Relation

    Publication Year: 2014, Page(s):49 - 58
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    The propositional interval logic of temporal neighborhood (PNL for short) features two modalities that make it possible to access intervals adjacent to the right (modality xAy) and to the left (modality xAy) of the current interval. PNL stands at a central position in the realm of interval temporal logics, as it is expressive enough to encode meaningful temporal conditions and decidable (undecidab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking Interval Properties of Computations

    Publication Year: 2014, Page(s):59 - 68
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (345 KB) | HTML iconHTML

    Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g. A Kripke structure, and a formula specifying its expected behavior, one can verify whether the system meets the behavior by checking the formula against the model. Classically, system behavior is given as a formula of a temporal logic, such as LTL and the like. These logics are "point-wise" ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Interval-Based Temporal Dependencies: The Complexity Landscape

    Publication Year: 2014, Page(s):69 - 78
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    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... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Framework for Managing Temporal Dimensions in Archaeological Data

    Publication Year: 2014, Page(s):81 - 90
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2039 KB) | HTML iconHTML

    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... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lean Index Structures for Snapshot Access in Transaction-Time Databases

    Publication Year: 2014, Page(s):91 - 100
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (450 KB) | HTML iconHTML

    In this work we introduce two lean temporal index structures to efficiently support snapshot access (i.e., Time-slice queries) in transaction-time databases. The two proposed structures, the RABTree and its RAB-Tree variant, are conceptually simple, easy to implement and efficient secondary index solutions. In particular, the RABTree index guarantees optimal performances for transaction-time data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Level Operations for Creation and Maintenance of Temporal and Conventional Schema in the tauXSchema Framework

    Publication Year: 2014, Page(s):101 - 110
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    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 cha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Summarizability in Multiversion Data Warehouse

    Publication Year: 2014, Page(s):111 - 120
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Over time, data warehouse (DW) schema and instances may undergo several changes reflecting the changes that occur in data sources or the emergence of new user analysis requirements. To deal with these changes and ensure the persistence of historical states of DW, we propose a multiversion DW model that ensures the temporal versioning of DW schema components as well as of its instances. Our model s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative Verification in Rational Environments

    Publication Year: 2014, Page(s):123 - 131
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    We study optimal equilibrium in turn based multiplayer mean-payoff games. Nash equilibrium are a standard way to define rational behaviour of different players in multi-player games. These equilibrium treat all players equally. We study settings where a leader has additional power over the game: she has the power to assign strategies to all participating players, including herself. We argue that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parametrized Verification Diagrams

    Publication Year: 2014, Page(s):132 - 141
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (319 KB) | HTML iconHTML

    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 GV... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of Rewrite Rules for Computation Tree Logics

    Publication Year: 2014, Page(s):142 - 151
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    A number of procedures for checking the satisfiability of formulas in the important branching time temporal logic CTL* have recently been proposed. This paper instead focuses on automatic generation and verification of rewrite rules for computation tree logics; shows that non-local computation tree logics can be used to verify rewrite rules, including for CTL*; presents an efficient tableau for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.