By Topic

2010 17th International Symposium on Temporal Representation and Reasoning

6-8 Sept. 2010

Filter Results

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

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

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

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

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

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

    Publication Year: 2010, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (59 KB) | HTML iconHTML
    Freely Available from IEEE
  • TIME 2010 Committees

    Publication Year: 2010, Page(s):viii - ix
    Request permission for commercial reuse | PDF file iconPDF (120 KB)
    Freely Available from IEEE
  • Regular Linear-Time Temporal Logic

    Publication Year: 2010, Page(s):3 - 5
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 KB) | HTML iconHTML

    This extended abstract presents the main ideas behind regular linear-time temporal logic (RLTL), a logic that generalizes linear-time temporal logic (LTL) with the ability to use regular expressions arbitrarily as sub-expressions. Unlike LTL, RLTL can define all !-regular languages and unlike previous approaches, RLTL is defined with an algebraic signature, does not depend on fix-points in its syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interval Temporal Logics with Chop-Like Operators

    Publication Year: 2010, Page(s): 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (122 KB) | HTML iconHTML

    This paper is talking about temporal logics with semantics based on intervals of time. Interval operators allow wide choice of temporal operators which includes unary operators with semantics and binary operators are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dealing with Uncertainty in Trajectory Databases

    Publication Year: 2010, Page(s):7 - 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (165 KB) | HTML iconHTML

    The paper is talking about moving object databases, a field of spatio-temporal databases and its applications in GIS.In moving object databases, several data models and query languages have been proposed to deal with moving objects whose position is recorded at different moments in time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CTL-Like Fragments of a Temporal Logic of Robustness

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

    The logic RoCTL* is an extension of the branching time temporal logic CTL* to represent robustness of systems to transient failures such as loss of data packets. New operators are introduced dealing with obligation (where no failures occur) and robustness (where at most one additional failure occurs). The only known decision procedures for the temporal logic of robustness RoCTL* are non-elementary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatizing the Temporal Logic Defined over the Class of All Lexicographic Products of Dense Linear Orders without Endpoints

    Publication Year: 2010, Page(s):19 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    This article considers the temporal logic defined over the class of all lexicographic products of dense linear orders without endpoints and gives its complete axiomatization for it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders

    Publication Year: 2010, Page(s):27 - 34
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    An interval temporal logic is a propositional, multi-modal logic interpreted over interval structures of partial orders. The semantics of each modal operator are given in the standard way with respect to one of the natural accessibility relations defined on such interval structures. In this paper, we consider the modal operators based on the (reflexive) sub-interval relation and the (reflexive) su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict-Tolerant Real-Time Specifications in Metric Temporal Logic

    Publication Year: 2010, Page(s):35 - 42
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB) | HTML iconHTML

    A framework based on the notion of "conflict-tolerance" was proposed in as a compositional methodology for developing and reasoning about systems that comprise multiple independent controllers. A central notion in this framework is that of a "conflict-tolerant" specification for a controller. In this work we propose a way of defining conflict-tolerant real-time specifications in Metric Interval Te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded Reachability for Temporal Logic over Constraint Systems

    Publication Year: 2010, Page(s):43 - 50
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (413 KB) | HTML iconHTML

    This paper defines CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. The paper introduces suitable restrictions and assumptions that make the satisfiability problem decidable in many cases, although the problem is undecidable in the general case. Decidability is shown for a large class of constraint systems, ... View full abstract»

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

    Publication Year: 2010, Page(s):51 - 58
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    This paper presents a quantitative extension for the linear-time temporal logic LTL allowing to specify the number of states satisfying certain sub-formulas along paths. We give decision procedures for the satisfiability and model checking of this new temporal logic and study the complexity of the corresponding problems. Furthermore we show that the problems become undecidable when more expressive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Timed Recursive State Machines

    Publication Year: 2010, Page(s):61 - 68
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    The paper proposes a temporal extension of Recursive State Machines (RSMs), called Timed RSMs (TRSMs). A TRSM is an indexed collection of Timed Automata allowed to invoke other Timed Automata (procedural calls). The classes of TRSMs are related to an extension of Pushdown Timed Automata, called EPTAs, where an additional stack, coupled with the standard control stack, is used to store temporal val... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real Time Properties for Interrupt Timed Automata

    Publication Year: 2010, Page(s):69 - 76
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    Interrupt Timed Automata (ITA) have been introduced to model multi-task systems with interruptions. They form a subclass of stopwatch automata, where the real valued variables (with rate 0 or 1) are organized along priority levels. While reachability is undecidable with usual stopwatches, the problem was proved decidable for ITA. In this work, after giving answers to some questions left open about... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata

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

    Real-time distributed systems may be modeled in different formalisms such as time Petri nets (TPN) and networks of timed automata (NTA). This paper focuses on translating a 1-bounded TPN into an NTA and considers an equivalence which takes the distribution of actions into account. This translation is extensible to bounded TPNs. We first use S-invariants to decompose the net into components that gi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Allen's Hourglass: Probabilistic Treatment of Interval Relations

    Publication Year: 2010, Page(s):87 - 94
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (197 KB) | HTML iconHTML

    The paper is motivated by the need to handle robustly the uncertainty of temporal intervals, e.g. as it occurs in automated event detection in video streams. The paper introduces a two-dimensional mapping of Allen's relations, based on orthogonal characteristics of interval relations, namely relative position and relative size. The hourglass-shaped mapping also represents limit cases that correspo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decidable Spatial Generalization of Metric Interval Temporal Logic

    Publication Year: 2010, Page(s):95 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    Temporal reasoning plays an important role in artificial intelligence. Temporal logics provide a natural framework for its formalization and implementation. A standard way of enhancing the expressive power of temporal logics is to replace their unidimensional domain by a multidimensional one. In particular, such a dimensional increase can be exploited to obtain spatial counterparts of temporal log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ontology Based Spatial Planning for Human-Robot Interaction

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

    In the last decade, there has been significant progress on Robotics. This development has widened the intervention fields of robots, particularly the assistance and interaction with humans. Improving the quality of this interaction requires robots to be endowed with representation and/or reasoning system for spatial knowledge. Our goal is to develop a planner allowing us to use human robot interac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Temporally-Cyclic Planning Problems

    Publication Year: 2010, Page(s):113 - 120
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    In order to correctly model certain real-world planning problems, it is essential to take into account time. This is the case for problems requiring the concurrent execution of actions (known as temporally-expressive problems). However, we show in this paper that certain existing planners which solve this type of problem are, in fact, incomplete. They cannot guarantee to find a solution to a probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Incremental Algorithm for Managing the Execution of Dynamically Controllable Temporal Networks

    Publication Year: 2010, Page(s):121 - 128
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    A Simple Temporal Network with Uncertainty (STNU) is a network of time points and temporal constraints in which the durations of certain temporal intervals - the contingent links-are bounded, but not controllable. An STNU is dynamically controllable if there is a real-time strategy for executing its non-contingent time points that guarantees the consistency of the network no matter how the duratio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Temporal Controllabilities for Workflow Schemata

    Publication Year: 2010, Page(s):129 - 136
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    The modelling and management of temporal constraints over business processes has received some attention in the past years. Recently, we have introduced and discussed the concept of "controllability" for workflow schemata modelling real world business processes: controllability, originally introduced in the AI community for temporal constraint networks, refers to the capability of executing a work... View full abstract»

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