Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking

Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than the equivalent CSTP model of Tsamardinos, Vidal and Pollack, from which it was derived mainly as a sound formalization. Three notions of consis...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings - International Workshop on Temporal Representation and Reasoning s. 19 - 28
Hlavní autoři: Comin, Carlo, Rizzi, Romeo
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 04.01.2016
Témata:
Algorithm design and analysis
Computational modeling
Conditional Simple Temporal Networks
Dynamic Consistency
Games
Heuristic algorithms
Hyper Temporal Networks
Mean Payoff Games
Planning
Reaction Time Analysis
Singly-Exponential Time
Terminology
Timing
ISSN:1530-1311
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than the equivalent CSTP model of Tsamardinos, Vidal and Pollack, from which it was derived mainly as a sound formalization. Three notions of consistency arise for CSTNs and CSTPs: weak, strong, and dynamic. Dynamic consistency is the most interesting notion, but it is also the most challenging and it was conjectured to be hard to assess. Tsamardinos, Vidal and Pollack gave a doubly-exponential time algorithm for deciding whether a CSTN is dynamically-consistent and to produce, in the positive case, a dynamic execution strategy of exponential size. In the present work we offer a proof that deciding whether a CSTN is dynamically-consistent is coNP-hard and provide the first singly-exponential time algorithm for this problem, also producing a dynamic execution strategy whenever the input CSTN is dynamically-consistent. The algorithm is based on a novel connection with Mean Payoff Games, a family of two-player infinite games played on finite graphs, well known for having applications in model-checking and formal verification. The presentation of such connection is mediated by the Hyper Temporal Network model, a tractable generalization of Simple Temporal Networks whose consistency checking is equivalent to determining Mean Payoff Games. In order to analyse the algorithm we introduce a refined notion of dynamic-consistency, named ε-dynamic-consistency, and present a sharp lower bounding analysis on the critical value of the reaction time where the CSTN transits from being, to not being, dynamically-consistent. The proof technique introduced in this analysis of the reaction time is applicable more generally when dealing with linear difference constraints which include strict inequalities.
AbstractList Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than the equivalent CSTP model of Tsamardinos, Vidal and Pollack, from which it was derived mainly as a sound formalization. Three notions of consistency arise for CSTNs and CSTPs: weak, strong, and dynamic. Dynamic consistency is the most interesting notion, but it is also the most challenging and it was conjectured to be hard to assess. Tsamardinos, Vidal and Pollack gave a doubly-exponential time algorithm for deciding whether a CSTN is dynamically-consistent and to produce, in the positive case, a dynamic execution strategy of exponential size. In the present work we offer a proof that deciding whether a CSTN is dynamically-consistent is coNP-hard and provide the first singly-exponential time algorithm for this problem, also producing a dynamic execution strategy whenever the input CSTN is dynamically-consistent. The algorithm is based on a novel connection with Mean Payoff Games, a family of two-player infinite games played on finite graphs, well known for having applications in model-checking and formal verification. The presentation of such connection is mediated by the Hyper Temporal Network model, a tractable generalization of Simple Temporal Networks whose consistency checking is equivalent to determining Mean Payoff Games. In order to analyse the algorithm we introduce a refined notion of dynamic-consistency, named ε-dynamic-consistency, and present a sharp lower bounding analysis on the critical value of the reaction time where the CSTN transits from being, to not being, dynamically-consistent. The proof technique introduced in this analysis of the reaction time is applicable more generally when dealing with linear difference constraints which include strict inequalities.
Author Rizzi, Romeo
Comin, Carlo
Author_xml – sequence: 1
  givenname: Carlo
  surname: Comin
  fullname: Comin, Carlo
  email: carlo.comin@unitn.it
  organization: Dept. of Math., Univ. of Trento, Trento, Italy
– sequence: 2
  givenname: Romeo
  surname: Rizzi
  fullname: Rizzi, Romeo
  email: romeo.rizzi@univr.it
  organization: Dept. of Comput. Sci., Univ. of Verona, Verona, Italy
BookMark eNotjlFLwzAUhSMouM29-eZL_kBnbtI2jW-jm3OwqWB9Hml2o2FtWpqi67-3ok-Hj8N3OFNy6RuPhNwCWwAwdV9s9-sFZ5AsILsgU4hTKZQAKS_JBBLBIhAA12QegiuZYExlmUom5LwavK6doXnjgws9ejPQxv7i0fWu8bqib65uK6QF1m3TjfyM_XfTnQL9cpruUXv6qofGWrrRNYYHuhwN_1EN0frcjid970apcDXSVR6ZTzSnsb4hV1ZXAef_OSPvj-sif4p2L5ttvtxFjsusj44mPhoTp6WxJuVlApgkGZPIrREqxjGzlGUlSC5KZY3lYGINOhEaLYpYiRm5-9t1iHhoO1frbjhIIUFxED_1-V8f
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/TIME.2015.18
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 1467393177
9781467393171
EndPage 28
ExternalDocumentID 7371921
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i278t-dc4dcc46bcfc62b51e55807e2fc394ee2f8608b1723b9fcf21c4a1a53aefe3493
IEDL.DBID RIE
ISICitedReferencesCount 14
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380571300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1530-1311
IngestDate Wed Aug 27 02:33:38 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i278t-dc4dcc46bcfc62b51e55807e2fc394ee2f8608b1723b9fcf21c4a1a53aefe3493
PageCount 10
ParticipantIDs ieee_primary_7371921
PublicationCentury 2000
PublicationDate 2016-01-04
PublicationDateYYYYMMDD 2016-01-04
PublicationDate_xml – month: 01
  year: 2016
  text: 2016-01-04
  day: 04
PublicationDecade 2010
PublicationTitle Proceedings - International Workshop on Temporal Representation and Reasoning
PublicationTitleAbbrev TIME
PublicationYear 2016
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib030098895
ssj0020519
Score 2.0655613
Snippet Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than...
SourceID ieee
SourceType Publisher
StartPage 19
SubjectTerms Algorithm design and analysis
Computational modeling
Conditional Simple Temporal Networks
Dynamic Consistency
Games
Heuristic algorithms
Hyper Temporal Networks
Mean Payoff Games
Planning
Reaction Time Analysis
Singly-Exponential Time
Terminology
Timing
Title Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking
URI https://ieeexplore.ieee.org/document/7371921
WOSCitedRecordID wos000380571300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07b8IwELYAdehEW6j6loeONSRxHNvdKh5tBxBSqcSGYseuIqEE8RL8-_oSoB26dHJs6RTLl-hO5---D6HHWETWVwkjlJmYhJwnRDHKiAt-himrRChtITbBh0MxmchRBT0de2GMMQX4zLTgsbjLT3K9hlJZm1MO9F1VVOU8Knu1Dt8OBWJMIX949iA1KblSPQKUMkfQu2yP3wc9AHWxFkh9_BJVKWJKv_6_3Zyh5k9zHh4dw845qpjsAtUP6gx4_7M20LZbis3jQpNzCbnxDucWpklaVgDxRwrkwHhc8lPN8LAEhS_xJo3xwMQZHsW73Fr8CmDaZ_ziLLKv2Y70tvM8A6CRM4IuEtztEOd-DYX3Jvrs98adN7LXWSBpwMWKJDpMtA4jpa2OAsV8w5jwuAmspjI0bhSRJ5RLdaiSVtvA12Hsx4zGxhoaSnqJapl76RXCvtSMaRZRHblURXpg6GmhGKBvuBTXqAEHOZ2XVBrT_Rne_L18i06dm8qKR3iHaqvF2tyjE71ZpcvFQ-H_bxYMr8c
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA86BT1NneK3OXg0s22SNvEmbn6gKwMr7DaSNJGCdLIPcf-9ee2cHrx4SlN4NCSvvMfL7_1-CJ0rEbtQ55xQbhVhSZITzSknPvhZrp0WTLpKbCJJUzEYyP4Kulj2wlhrK_CZbcNjdZefj8wMSmWXCU2AvmsVrXHGoqDu1vr2HgrUmEL-MO1BclKzpQYESGWWsHd5mT30ugDr4m0Q-_glq1JFldvm_9azhXZ_2vNwfxl4ttGKLXdQ81ufAS9-1xb67NRy87hS5ZxAdjzHIwfTvKhrgPi5AHpgnNUMVW84rWHhE_xRKNyzqsR9NR85h-8ATnuFr71F-fo2J93P91EJUCNvBH0kuHNDvAMYKL3vopfbbnZzTxZKC6SIEjEluWG5MSzWxpk40jy0nIsgsZEzVDLrRxEHQvtkh2rpjItCw1SoOFXWWcok3UON0n90H-FQGs4Nj6mJfbIiAzAMjNAc8DeJFAeoBRs5fK_JNIaLPTz8-_UZ2rjPek_Dp4f08Qht-iOr6x_sGDWm45k9QevmY1pMxqeVL3wBaJWzDg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+-+International+Workshop+on+Temporal+Representation+and+Reasoning&rft.atitle=Dynamic+Consistency+of+Conditional+Simple+Temporal+Networks+via+Mean+Payoff+Games%3A+A+Singly-Exponential+Time+DC-checking&rft.au=Comin%2C+Carlo&rft.au=Rizzi%2C+Romeo&rft.date=2016-01-04&rft.pub=IEEE&rft.issn=1530-1311&rft.spage=19&rft.epage=28&rft_id=info:doi/10.1109%2FTIME.2015.18&rft.externalDocID=7371921
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-1311&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-1311&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-1311&client=summon