2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)

17-19 Oct. 2016

Filter Results

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

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

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

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

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

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

    Publication Year: 2016, Page(s): viii
    Request permission for reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • Conference Committees

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

    Publication Year: 2016, Page(s): x
    Request permission for reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Automatic Verification, Performance Analysis, Synthesis and Optimization of Timed Systems

    Publication Year: 2016, Page(s): 1
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Summary form only given. Timed automata and games, priced timed automata and energy automata have emerged as useful formalisms for modeling real-time and energy-aware systems as found in several embedded and cyber-physical systems. Within the last 20 years the various components of the UPPAAL tool-suite has been developed to support various types of analysis of these formalisms. This includes the ... View full abstract»

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

    Publication Year: 2016, Page(s): 2
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (75 KB) | HTML iconHTML

    Model checking is a successful technique widely used in formal verification. Given a model of a system and a formula specifying a desired property of it, one can verify whether the system satisfies the property by checking the formula against the model. Distinctive features of model checking are: (i) it is a fully automatic process, (ii) it exaustively checks all the possible behaviours of the sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Impact of the Telic\Atelic Dichotomy on Temporal Databases

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

    The telic\atelic distinction, first introduced by Aristotle in his Categories [1], has a long tradition in the Western culture. Prior research in philosophy, linguistics, cognitive science, artificial intelligence and other areas suggests the need to differentiate between temporal facts with goal-related semantics (i.e., telic) from those that are intrinsically devoid of goal\culmination (i.e., at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic Simulation of Parametrized Hybrid Systems with Affine Arithmetic

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

    The purpose of this research is to develop a highly reliable simulator of hybrid systems, i.e., systems involving both discrete change and continuous evolution. In particular, we aim at rigorous simulation of parametrized hybrid systems, which enables not only the analysis of model's possible behavior but also the design of parameters that realize desired properties. Simulators with interval arith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Control for Simple Linear Hybrid Systems

    Publication Year: 2016, Page(s):12 - 20
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    This paper studies optimal time-bounded control in a simple subclass of linear hybrid systems, which consists of one continuous variable and global constraints. Each state has a continuous cost attached to it, which is linear in the sojourn time, while a discrete cost is attached to each transition taken. We show the corresponding decision problem to be NP-complete and develop an FPTAS for finding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Model Checking Problem in Networks with Quasi-Equal Clocks

    Publication Year: 2016, Page(s):21 - 30
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    Quasi-equal clocks reduction for networks of timed automata yields significant savings in verification costs of properties of timed automata by replacing clocks in equivalence classes by representative clocks. In this work we present the theoretical analysis that quantifies and justifies those savings. We propose new space and time bounds that characterise a less expensive model checking effort in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking for the Full Hybrid Computation Tree Logic

    Publication Year: 2016, Page(s):31 - 40
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verify LTL with Fairness Assumptions Efficiently

    Publication Year: 2016, Page(s):41 - 50
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (221 KB) | HTML iconHTML

    This paper deals with model checking problems with respect to LTL properties under fairness assumptions. We first present an efficient algorithm to deal with a fragment of fairness assumptions and then extend the algorithm to handle arbitrary ones. Notably, by making use of some syntactic transformations, our algorithm avoids constructing corresponding Büchi automata for the whole fairness assumpt... View full abstract»

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

    Publication Year: 2016, Page(s):51 - 59
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (438 KB) | HTML iconHTML

    We consider the emerging field of music score libraries, where documents rely on a music notation markup language such as MusicXML or MEI. We propose to model as synchronized time-series the music structure that can be extracted from such documents, together with an algebra that operates in closed form and allows manipulations, restructurings, and combinations of music scores stored in a database.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Domain-Specific Language for Normative Texts with Timing Constraints

    Publication Year: 2016, Page(s):60 - 69
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    We are interested in the formal modelling and analysis of normative documents containing temporal restrictions. This paper presents a new language for this purpose, based on the deontic modalities of obligation, permission, and prohibition. It allows the specification of normative clauses over actions, which can be conditional on guards and timing constraints defined using absolute or relative dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification of Evolving Privacy Policies for Online Social Networks

    Publication Year: 2016, Page(s):70 - 79
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Online Social Networks are ubiquitous, bringing not only numerous new possibilities but also big threats and challenges. Privacy is one of them. Most social networks today offer a limited set of (static) privacy settings, not being able to express dynamic policies. For instance, users might decide to protect their location during the night, or share information with difference audiences depending ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks

    Publication Year: 2016, Page(s):80 - 89
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (321 KB)

    Conditional Simple Temporal Network CSTN is a constraint-based graph-formalism for conditional temporal planning. Three notions of consistency arise for CSTNs and CSTPs: weak, strong, and dynamic. Dynamic-Consistency (DC) is the most interesting notion, but it is also the most challenging. In order to address the DC-Checking problem, in [Comin and Rizzi, TIME 2015] we introduced ε-DC (a refined, m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete

    Publication Year: 2016, Page(s):90 - 99
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically Controllable had still remained widely open. This issue gets settled in this paper which provides constructions, algorithms, and bridging lemmas and arguments to formally prove that: (1) the problem is PSPACE-hard, and (2) the problem lies i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timelines Are Expressive Enough to Capture Action-Based Temporal Planning

    Publication Year: 2016, Page(s):100 - 109
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    Planning prblems are usually expressed by specifying which actions can be performed to obtain a given goal. In temporal planning problems, actions come with a time duration and can overlap in time, which noticeably increase the complexity of the reasoning process. Action-based temporal planning has been thoroughly studied from the complexity-theoretic point of view, and it has been proved to be EX... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency in Parametric Interval Probabilistic Timed Automata

    Publication Year: 2016, Page(s):110 - 119
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the consistency problem that amounts to deciding whether a given specification admits at least one implementation. In the context of Interval Probabilistic Timed Automata (w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Free Choice and Time in Petri Nets

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

    Time Petri nets (TPNs) (Merlin 1974) are a classical extension of Petri nets with timing constraints attached to transitions, for which most verification problems are undecidable. We consider TPNs under a strong semantics with multiple enabling of transitions. We focus on a structural subclass of unbounded TPNs, where the underlying untimed net is free choice, and show that it enjoys nice properti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling Systems over General Linear Time

    Publication Year: 2016, Page(s):130 - 139
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (245 KB) | HTML iconHTML

    It has been shown that every temporal logic formula satisfiable over general linear time has a model than can be expressed as a finite Model Expression (ME). The reals are a subclass of general linear time, so similar techniques can be used for the reals. Although MEs are expressive enough for this task, they represent only a single class of elementary equivalent models. In the case where time is ... View full abstract»

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