Termination and Correctness Analysis of Cyclic Control
Abstract
The utility of including cyclic flows of control in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and safety properties of loops of actions. We present an overview of recent results for determining the class of problems that a plan with loops can solve. These methods can be used to direct the construction of a rich new form of generalized plans that solve a desired class of problems.
Cite
Text
Srivastava et al. "Termination and Correctness Analysis of Cyclic Control." AAAI Conference on Artificial Intelligence, 2011. doi:10.1609/AAAI.V25I1.7963Markdown
[Srivastava et al. "Termination and Correctness Analysis of Cyclic Control." AAAI Conference on Artificial Intelligence, 2011.](https://mlanthology.org/aaai/2011/srivastava2011aaai-termination/) doi:10.1609/AAAI.V25I1.7963BibTeX
@inproceedings{srivastava2011aaai-termination,
title = {{Termination and Correctness Analysis of Cyclic Control}},
author = {Srivastava, Siddharth and Immerman, Neil and Zilberstein, Shlomo},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2011},
pages = {1567-1570},
doi = {10.1609/AAAI.V25I1.7963},
url = {https://mlanthology.org/aaai/2011/srivastava2011aaai-termination/}
}