Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification

DOI10.1007/S00236-015-0248-8zbMath1350.68252OpenAlexW2203308532MaRDI QIDQ329426

Mikael Nilsson, Patrick Doherty, Jonas Kvarnström

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

Mathematics Subject Classification ID

Data structures (68P05) Agent technology and artificial intelligence (68T42)

Related Items (2)

Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification ⋮ Efficient execution of dynamically controllable simple temporal networks with uncertainty

Cites Work

• Unnamed Item
• Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
• Temporal constraint networks
• A New Approach to Incremental Cycle Detection and Related Problems
• Dynamic Controllability and Dispatchability Relationships

This page was built for publication: Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification