Efficient execution of dynamically controllable simple temporal networks with uncertainty
DOI10.1007/S00236-015-0227-0zbMATH Open1336.68250OpenAlexW2012801949MaRDI QIDQ262129FDOQ262129
Publication date: 29 March 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-015-0227-0
Recommendations
- Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
- Dynamic controllability made simple
- Faster dynamic controllability checking for simple temporal networks with uncertainty
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Sound-and-complete algorithms for checking the dynamic controllability of conditional simple temporal networks with uncertainty
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Nonnumerical algorithms (68W05)
Cites Work
- Introduction to algorithms.
- Temporal constraint networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Title not available (Why is that?)
- Dynamic controllability via timed game automata
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Title not available (Why is that?)
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Title not available (Why is that?)
- Dynamic Controllability and Dispatchability Relationships
Cited In (7)
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU)
- Quantifying controllability in temporal networks with uncertainty
- Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
- Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
- Dynamic controllability made simple
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
This page was built for publication: Efficient execution of dynamically controllable simple temporal networks with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262129)
