Hyper Temporal Networks - Archive ouverte HAL Access content directly
Journal Articles Constraints Year : 2017

Hyper Temporal Networks


Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this paper we introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints but maintaining a practical efficiency in the consistency check of the instances. In a Hyper Temporal Network a single temporal hyperarc constraint may be defined as a set of two or more maximum delay constraints which is satisfied when at least one of these delay constraints is satisfied. HyTNs are meant as a light generalization of STNs offering an interesting compromise. On one side, there exist practical pseudo-polynomial time algorithms for checking consistency and computing feasible schedules for HyTNs. On the other side, HyTNs offer a more powerful model accommodating natural constraints that cannot be expressed by STNs like “Trigger off exactly δ min before (after) the occurrence of the first (last) event in a set.”, which are used to represent synchronization events in some process aware information systems/workflow models proposed in the literature.
Fichier principal
Vignette du fichier
stnmaxmpg3.pdf (857.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01577455 , version 1 (25-08-2017)



Carlo Comin, Roberto Posenato, Romeo Rizzi. Hyper Temporal Networks: A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games. Constraints, 2017, 22 (2), pp.152-190. ⟨10.1007/s10601-016-9243-0⟩. ⟨hal-01577455⟩
186 View
108 Download



Gmail Facebook Twitter LinkedIn More