Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
From MaRDI portal
Publication:329426
DOI10.1007/S00236-015-0248-8zbMATH Open1350.68252OpenAlexW2203308532MaRDI QIDQ329426FDOQ329426
Authors: Mikael Nilsson, Jonas Kvarnström, Patrick Doherty 
Publication date: 21 October 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-121949
Recommendations
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
- Faster dynamic controllability checking for simple temporal networks with uncertainty
- Sound-and-complete algorithms for checking the dynamic controllability of conditional simple temporal networks with uncertainty
- Dynamic controllability made simple
Cites Work
- Temporal constraint networks
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Dynamic controllability and dispatchability relationships
- Title not available (Why is that?)
- A new approach to incremental cycle detection and related problems
Cited In (5)
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Quantifying controllability in temporal networks with uncertainty
- Dynamic controllability of temporal plans in uncertain and partially observable environments
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
This page was built for publication: Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329426)
