Conditional simple temporal networks with uncertainty and decisions
DOI10.1016/J.TCS.2018.09.023zbMATH Open1434.68552OpenAlexW2899843791WikidataQ128911684 ScholiaQ128911684MaRDI QIDQ2334599FDOQ2334599
Authors: Matteo Zavatteri, Luca Viganò 
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/
Recommendations
- Conditional simple temporal networks with uncertainty and decisions
- Conditional Simple Temporal Networks with Uncertainty and Resources
- Incorporating decision nodes into conditional simple temporal networks
- Sound-and-complete algorithms for checking the dynamic controllability of conditional simple temporal networks with uncertainty
- Dynamic controllability made simple
controller synthesisdynamic controllabilitytimed game automataCSTNUDadvanced temporal planning under uncertaintyESSE
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Attainable sets, reachability (93B03) Synthesis problems (93B50)
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- Temporal constraint networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Drake: an efficient executive for temporal plans with choice
- Dynamic controllability via timed game automata
- Model-checking in dense real-time
- On the synthesis of discrete controllers for timed systems
- Incorporating decision nodes into conditional simple temporal networks
- Conditional simple temporal networks with uncertainty and decisions
Cited In (14)
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
- A streamlined model of conditional simple temporal networks -- semantics and equivalence results
- Incorporating decision nodes into conditional simple temporal networks
- Extending conditional simple temporal networks with partially shrinkable uncertainty
- Conditional simple temporal networks with uncertainty and decisions
- Mining Significant Temporal Networks Is Polynomial
- Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU)
- Determining temporal agreements in cross-organizational business processes
- Mining CSTNUDs significant for a set of traces is polynomial
- Dynamic controllability of temporal networks with instantaneous reaction
- Dynamic controllability of temporal plans in uncertain and partially observable environments
- An interdisciplinary experimental evaluation on the disjunctive temporal problem
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
- Conditional Simple Temporal Networks with Uncertainty and Resources
This page was built for publication: Conditional simple temporal networks with uncertainty and decisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334599)
