Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
From MaRDI portal
(Redirected from Publication:329426)
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
- scientific article; zbMATH DE number 5887274 (Why is no real title available?)
- A new approach to incremental cycle detection and related problems
- Dynamic controllability and dispatchability relationships
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Temporal constraint networks
Cited in
(5)- Quantifying controllability in temporal networks with uncertainty
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
- Dynamic controllability of temporal plans in uncertain and partially observable environments
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
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)
