Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way

A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between them. A Simple Temporal Network with Decisions (STND) extends an STN to model temporal plans with decisions. STNDs label time points and constra...

Full description

Saved in:
Bibliographic Details
Published in:Information and computation 2021-10, Vol.280, p.104637, Article 104637
Main Authors: Zavatteri, Matteo, Combi, Carlo, Rizzi, Romeo, Viganò, Luca
Format: Article
Language:English
Subjects:
Access control
Disjunctive temporal network
HSCC algorithms
Incremental SAT-solving
Simple temporal network with decisions
Temporal constraints
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between them. A Simple Temporal Network with Decisions (STND) extends an STN to model temporal plans with decisions. STNDs label time points and constraints by conjunctions of literals saying for which scenarios (i.e., complete truth value assignments to the propositions) they are relevant. In this paper, we deal with the use of STNDs for modeling and synthesizing execution strategies. We propose an incremental hybrid SAT-based consistency checking algorithm for STNDs that is faster than the one previously proposed and allows for the synthesis of all consistent scenarios and related early execution schedules (offline temporal planning). We carry out an experimental evaluation with Kappa, a tool that we developed for STNDs. We also show that any STND can be easily translated into a disjunctive temporal network and vice versa.
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2020.104637