License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2017.10
URN: urn:nbn:de:0030-drops-79145
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7914/
Cairo, Massimo ;
Hunsberger, Luke ;
Posenato, Roberto ;
Rizzi, Romeo
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results
Abstract
A Conditional Simple Temporal Network (CSTN) augments a Simple Temporal Network to include a new kind of time-points, called observation time-points. The execution of an observation time-point generates information in real time, specifically, the truth value of a propositional letter. In addition, time-points and temporal constraints may be labeled by conjunctions of (positive or negative) propositional letters. A CSTN is called dynamically consistent (DC) if there exists a dynamic strategy for executing its time-points such that no matter how the observations turn out during execution, the time-points whose labels are consistent with those observations have all been executed, and the constraints whose labels are consistent with those observations have all been satisfied. The strategy is dynamic in that its execution decisions may react to observations.
The original formulation of CSTNs included propositional labels only on time-points, but the DC-checking algorithm was impractical because it was based on a conversion of the semantic constraints into an exponentially-sized Disjunctive Temporal Network. Later work added propositional labels to temporal constraints, and yielded a sound-and-complete propagation-based DC-checking algorithm, empirically demonstrated to be practical across a variety of CSTNs.
This paper introduces a streamlined version of a CSTN in which propositional labels may appear on constraints, but not on time-points. This change simplifies the definition of the DC property, as well as the propagation rules for the DC-checking algorithm. It also simplifies the proofs of the soundness and completeness of those rules.
This paper provides two translations from traditional CSTNs to streamlined CSTNs. Each translation preserves the DC property and, for any DC network, ensures that any dynamic execution strategy for that network can be extended to a strategy for its streamlined counterpart.
Finally, this paper presents an empirical comparison of two versions of the DC-checking algorithm: the original version and a simplified version for streamlined CSTNs. The comparison is based on CSTN benchmarks from earlier work. For small-sized CSTNs, the original version shows the best performance, but the performance difference between the two versions decreases as the number of time-points in the CSTN increases. We conclude that the simplified algorithm is a practical alternative for checking the dynamic consistency of CSTNs.
BibTeX - Entry
@InProceedings{cairo_et_al:LIPIcs:2017:7914,
author = {Massimo Cairo and Luke Hunsberger and Roberto Posenato and Romeo Rizzi},
title = {{A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results}},
booktitle = {24th International Symposium on Temporal Representation and Reasoning (TIME 2017)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-052-1},
ISSN = {1868-8969},
year = {2017},
volume = {90},
editor = {Sven Schewe and Thomas Schneider and Jef Wijsen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7914},
URN = {urn:nbn:de:0030-drops-79145},
doi = {10.4230/LIPIcs.TIME.2017.10},
annote = {Keywords: Conditional Simple Temporal Networks, Dynamic Consistency, Temporal Constraints}
}
|
Keywords: |
|
Conditional Simple Temporal Networks, Dynamic Consistency, Temporal Constraints |
|
Collection: |
|
24th International Symposium on Temporal Representation and Reasoning (TIME 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
25.09.2017 |
