2011 Eighteenth International Symposium on Temporal Representation and Reasoning

12-14 Sept. 2011

Filter Results

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

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

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

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

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

    Publication Year: 2011, Page(s):v - vii
    Request permission for reuse | PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2011, Page(s): viii
    Request permission for reuse | PDF file iconPDF (113 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee Organization

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

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

    Publication Year: 2011, Page(s): xi
    Request permission for reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • p-Automata and Obligation Games

    Publication Year: 2011, Page(s):3 - 6
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (178 KB) | HTML iconHTML

    We present our automata-based approach to probabilistic verification. This new approach adapts notions and techniques from alternating tree automata to the realm of Markov chains. The resulting p-automata determine languages of Markov chains. In order to determine acceptance of Markov chains by p-automata we develop a new notion of games, which we call obligation games. Intuitively, one player com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending ITL with Interleaved Programs for Interactive Verification

    Publication Year: 2011, Page(s): 7
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (102 KB) | HTML iconHTML

    The talk presents extensions of ITL that make it a powerful logic to reason about interleaved programs with recursive procedures. The extensions have been implemented in the interactive theorem prover KIV. View full abstract»

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

    Publication Year: 2011, Page(s):8 - 9
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (107 KB) | HTML iconHTML

    While many frameworks for reasoning about time rely on the assumption that, as along as precedences are respected and there are no overlapping activities, any available time is just as good, all of us know that that is really not true! All of us would prefer avoiding heavy meetings right after lunch, waiting for connecting flights for endless hours or going on vacation at a selected destination du... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a Foundation of Data Currency

    Publication Year: 2011, Page(s):10 - 11
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    One often finds that multiple values of the same entity reside in a database. While all of these values were once correct, most of them may have become stale and inaccurate. Worse still, the values often do not carry reliable timestamps. With this comes the need for studying data currency, to identify the current value of an entity in a database and to answer queries with the current values, in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Encoding of Temporal XML Documents

    Publication Year: 2011, Page(s):15 - 22
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (237 KB) | HTML iconHTML

    The management of temporal data is a crucial issue in many applications. Recently, XML has become the standard for data exchange and representation. Consequently, important efforts have been made on the development of temporal extensions for XML. This paper investigates how to generate or maintain space-efficient time-stamped documents. We formally define a notion of compactness which allows for c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Functional Dependencies Based on Interval Relations

    Publication Year: 2011, Page(s):23 - 30
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (622 KB) | HTML iconHTML

    In the last years the representation and management of temporal information has become crucial for several computer applications. In the temporal database literature, every fact stored into a database may be equipped with two temporal dimensions: the valid time, that describes the time when the fact is true in the modeled reality, and the transaction time, that describes the time when the fact is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of Time Ontologies with Points and Intervals

    Publication Year: 2011, Page(s):31 - 38
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    Ontology verification is concerned with the relationship between the intended structures for an ontology and the models of the axiomatization of the ontology. The verification of a particular ontology requires characterization of the models of the ontology up to isomorphism and a proof that these models are equivalent to the intended structures for the ontology. In this paper we consider the verif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tableau for Until and Since over Linear Time

    Publication Year: 2011, Page(s):41 - 48
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    We use mosaics and games to provide a simple, sound and complete tableau reasoning procedure for the temporal logic of until and since over general linear time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Experimental Comparison of Theorem Provers for CTL

    Publication Year: 2011, Page(s):49 - 56
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on tree-tableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from the literature. In the process, we gather and analyse a set of test formulae which could form the basis of a suite of benchmark formulae for CTL. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Access to the Iteration Sequences: A Unifying Approach to Fixed Point Logics

    Publication Year: 2011, Page(s):57 - 63
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    The semantics of fixed point constructions is commonly defined in terms of iteration sequences. For example, the least fixed point of a monotone operator consists of all points which eventually appear in the approximations computed iteratively. We take this temporal reading as the starting point and develop a systematic approach to temporal definitions over iteration sequences. As a result, we pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesising Classic and Interval Temporal Logic

    Publication Year: 2011, Page(s):64 - 71
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    Linear-Time Temporal Logic (LTL) is one of the most influential logics for the specification and verification of reactive systems. An important selling point of LTL is its striking simplicity, which might be a reason why none of the many extensions suggested to LTL have gained the same influence. Interval based temporal logics like Interval Temporal Logic (ITL) are a more recent branch of temporal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Relaxing Metric Information in Linear Temporal Logic

    Publication Year: 2011, Page(s):72 - 79
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    Metric LTL formulas rely on the next operator to encode time distances, whereas qualitative LTL formulas use only the until operator. This paper shows how to transform any metric LTL formula M into a qualitative formula Q, such that Q is satisfiable if and only if M is satisfiable over words with variability bounded with respect to the largest distances used in M (i.e., occurrences of next), but t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Temporal Logic and Propositional Schemata, Back and Forth

    Publication Year: 2011, Page(s):80 - 87
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced in elsewhere by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one logic to the other. Some consequences about complexity are given. We report about first experiments and the consequences about possible improvements... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring Usage-Control Policies in Distributed Systems

    Publication Year: 2011, Page(s):88 - 95
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    We have previously presented a monitoring algorithm for compliance checking of policies formalized in an expressive metric first-order temporal logic. We explain here the steps required to go from the original algorithm to a working infrastructure capable of monitoring an existing distributed application producing millions of log entries per day. The main challenge is to correctly and efficiently ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleaved Programs and Rely-Guarantee Reasoning with ITL

    Publication Year: 2011, Page(s):99 - 106
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    This paper presents a logic that extends basic ITL with explicit, interleaved programs. The calculus is based on symbolic execution, as previously described. We extend this former work here, by integrating the logic with higher-order logic, adding recursive procedures and rules to reason about fairness. Further, we show how rules for rely-guarantee reasoning can be derived and outline the applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compositional Reasoning Using Intervals and Time Reversal

    Publication Year: 2011, Page(s):107 - 114
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    We apply Interval Temporal Logic (ITL), an established temporal formalism for reasoning about time periods, to extending known facts by looking at them in reverse and then reducing reasoning about infinite time to finite time. Time reversal then helps to compositionally analyse some aspects of concurrent behaviour involving mutual exclusion. View full abstract»

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