Conditional simple temporal networks with uncertainty and decisions

DOI10.1016/J.TCS.2018.09.023zbMath1434.68552OpenAlexW2899843791WikidataQ128911684 ScholiaQ128911684MaRDI QIDQ2334599

Luca Viganò, Matteo Zavatteri

Publication date: 7 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7916/

zbMATH Keywords

controller synthesisdynamic controllabilitytimed game automataCSTNUDadvanced temporal planning under uncertaintyESSE

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Synthesis problems (93B50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Attainable sets, reachability (93B03)

Related Items (7)

Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU) ⋮ Dynamic controllability of temporal networks with instantaneous reaction ⋮ Mining Significant Temporal Networks Is Polynomial ⋮ Mining CSTNUDs significant for a set of traces is polynomial ⋮ Determining temporal agreements in cross-organizational business processes

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic controllability via timed game automata
• Model-checking in dense real-time
• Temporal constraint networks
• A theory of timed automata
• CTP: A new constraint-based formalism for conditional, temporal planning
• On the synthesis of discrete controllers for timed systems

This page was built for publication: Conditional simple temporal networks with uncertainty and decisions