Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty-Reference-Cited by-同舟云学术

Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty

Published:2019-06 Issue: Volume:271 Page:1-17
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Bhargava Nikhil,Williams Brian C.

Funder

Toyota Research Institute

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference27 articles.

1. Dynamic controllability of conditional simple temporal networks is pspace-complete;Cairo,2016

2. Incorporating decision nodes into conditional simple temporal networks;Cairo,2017

3. Sound and complete algorithms for checking the dynamic controllability of temporal networks with uncertainty, disjunction and observation;Cimatti,2014

4. Dynamic controllability of disjunctive temporal networks: validation and synthesis of executable strategies;Cimatti,2016

5. An algorithm for checking the dynamic controllability of a conditional simple temporal network with uncertainty;Combi,2013

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic controllability of temporal networks with instantaneous reaction;Information Sciences;2022-10

2. Determining temporal agreements in cross-organizational business processes;Information and Computation;2021-12

3. Enabling Limited Resource-Bounded Disjunction in Scheduling;Journal of Aerospace Information Systems;2021-06

4. On the Complexity of Resource Controllability in Business Process Management;Business Process Management Workshops;2020