Finite LTL Synthesis as Planning. Camacho, A., Baier, J. A., Muise, C., & McIlraith, S. A. In *Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling (ICAPS)*, 2018. Paper abstract bibtex LTL synthesis is the task of generating a strategy that satisfies a Linear Temporal Logic (LTL) specification interpreted over infinite traces. In this paper we examine the problem of LTLf synthesis, a variant of LTL synthesis where the specification of the behaviour of the strategy we generate is interpreted over finite traces – similar to the assumption we make in many planning problems, and important for the synthesis of business processes and other system interactions of finite duration. Existing approaches to LTLf synthesis transform LTLf into deterministic finite-state automata (DFA) and reduce the synthesis problem to a DFA game. Unfortunately, the DFA transformation is worst-case double-exponential in the size of the formula, presenting a computational bottleneck. In contrast, our approach exploits non-deterministic automata, and we reduce the synthesis problem to a non-deterministic planning problem. We leverage our approach not only for strategy generation but also to generate certificates of unrealizability – the first such method for LTLf. We employ a battery of techniques that exploit the structure of the LTLf specification to improve the efficiency of our transformation to automata. We combine these techniques with lazy determinization of automata and on-the-fly state abstraction. We illustrate the effectiveness of our approach on a set of established LTL synthesis benchmarks adapted to finite LTL.

@inproceedings{cam-bai-mui-mci-icaps18,
author = {Alberto Camacho and
Jorge A. Baier and
Christian Muise and
Sheila A. McIlraith},
title = {Finite {LTL} Synthesis as Planning},
booktitle = {Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling ({ICAPS})},
year = {2018},
url = {http://www.cs.toronto.edu/~acamacho/papers/cam-bai-mui-mci-icaps18.pdf},
abstract = {LTL synthesis is the task of generating a strategy that satisfies a Linear Temporal Logic (LTL) specification interpreted over infinite traces. In this paper we examine the problem of LTLf synthesis, a variant of LTL synthesis where the specification of the behaviour of the strategy we generate is interpreted over finite traces – similar to the assumption we make in many planning problems, and important for the synthesis of business processes and other system interactions of finite duration. Existing approaches to LTLf synthesis transform LTLf into deterministic finite-state automata (DFA) and reduce the synthesis problem to a DFA game. Unfortunately, the DFA transformation is worst-case double-exponential in the size of the formula, presenting a computational bottleneck. In contrast, our approach exploits non-deterministic automata, and we reduce the synthesis problem to a non-deterministic planning problem. We leverage our approach not only for strategy generation but also to generate certificates of unrealizability – the first such method for LTLf. We employ a battery of techniques that exploit the structure of the LTLf specification to improve the efficiency of our transformation to automata. We combine these techniques with lazy determinization of automata and on-the-fly state abstraction. We illustrate the effectiveness of our approach on a set of established LTL synthesis benchmarks adapted to finite LTL.}
}

Downloads: 0

{"_id":"2RFgwcJSM6EkTcEG8","bibbaseid":"camacho-baier-muise-mcilraith-finiteltlsynthesisasplanning-2018","downloads":17,"creationDate":"2018-01-30T14:38:33.263Z","title":"Finite LTL Synthesis as Planning","author_short":["Camacho, A.","Baier, J. A.","Muise, C.","McIlraith, S. A."],"year":2018,"bibtype":"inproceedings","biburl":"www.haz.ca/publications.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Alberto"],"propositions":[],"lastnames":["Camacho"],"suffixes":[]},{"firstnames":["Jorge","A."],"propositions":[],"lastnames":["Baier"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Muise"],"suffixes":[]},{"firstnames":["Sheila","A."],"propositions":[],"lastnames":["McIlraith"],"suffixes":[]}],"title":"Finite LTL Synthesis as Planning","booktitle":"Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling (ICAPS)","year":"2018","url":"http://www.cs.toronto.edu/~acamacho/papers/cam-bai-mui-mci-icaps18.pdf","abstract":"LTL synthesis is the task of generating a strategy that satisfies a Linear Temporal Logic (LTL) specification interpreted over infinite traces. In this paper we examine the problem of LTLf synthesis, a variant of LTL synthesis where the specification of the behaviour of the strategy we generate is interpreted over finite traces – similar to the assumption we make in many planning problems, and important for the synthesis of business processes and other system interactions of finite duration. Existing approaches to LTLf synthesis transform LTLf into deterministic finite-state automata (DFA) and reduce the synthesis problem to a DFA game. Unfortunately, the DFA transformation is worst-case double-exponential in the size of the formula, presenting a computational bottleneck. In contrast, our approach exploits non-deterministic automata, and we reduce the synthesis problem to a non-deterministic planning problem. We leverage our approach not only for strategy generation but also to generate certificates of unrealizability – the first such method for LTLf. We employ a battery of techniques that exploit the structure of the LTLf specification to improve the efficiency of our transformation to automata. We combine these techniques with lazy determinization of automata and on-the-fly state abstraction. We illustrate the effectiveness of our approach on a set of established LTL synthesis benchmarks adapted to finite LTL.","bibtex":"@inproceedings{cam-bai-mui-mci-icaps18,\n author = {Alberto Camacho and\n Jorge A. Baier and\n Christian Muise and\n Sheila A. McIlraith},\n title = {Finite {LTL} Synthesis as Planning},\n booktitle = {Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling ({ICAPS})},\n year = {2018},\n url = {http://www.cs.toronto.edu/~acamacho/papers/cam-bai-mui-mci-icaps18.pdf},\n abstract = {LTL synthesis is the task of generating a strategy that satisfies a Linear Temporal Logic (LTL) specification interpreted over infinite traces. In this paper we examine the problem of LTLf synthesis, a variant of LTL synthesis where the specification of the behaviour of the strategy we generate is interpreted over finite traces – similar to the assumption we make in many planning problems, and important for the synthesis of business processes and other system interactions of finite duration. Existing approaches to LTLf synthesis transform LTLf into deterministic finite-state automata (DFA) and reduce the synthesis problem to a DFA game. Unfortunately, the DFA transformation is worst-case double-exponential in the size of the formula, presenting a computational bottleneck. In contrast, our approach exploits non-deterministic automata, and we reduce the synthesis problem to a non-deterministic planning problem. We leverage our approach not only for strategy generation but also to generate certificates of unrealizability – the first such method for LTLf. We employ a battery of techniques that exploit the structure of the LTLf specification to improve the efficiency of our transformation to automata. We combine these techniques with lazy determinization of automata and on-the-fly state abstraction. We illustrate the effectiveness of our approach on a set of established LTL synthesis benchmarks adapted to finite LTL.}\n}\n\n","author_short":["Camacho, A.","Baier, J. A.","Muise, C.","McIlraith, S. A."],"key":"cam-bai-mui-mci-icaps18","id":"cam-bai-mui-mci-icaps18","bibbaseid":"camacho-baier-muise-mcilraith-finiteltlsynthesisasplanning-2018","role":"author","urls":{"Paper":"http://www.cs.toronto.edu/~acamacho/papers/cam-bai-mui-mci-icaps18.pdf"},"metadata":{"authorlinks":{"camacho, a":"https://young-frost-5511.herokuapp.com/","mcilraith, s":"https://www.cs.toronto.edu/","muise, c":"http://www.haz.ca/"}},"html":""},"search_terms":["finite","ltl","synthesis","planning","camacho","baier","muise","mcilraith"],"keywords":[],"authorIDs":["CBLksFoEERH5GZA5T","GvvCbq8Y4n9QqTySC","f4LpZ8LcDrvDyGuip"],"dataSources":["2LLKDfkxMDdABm58M","euD7cPywCk5gX9zDY","DprwGzu9heN5GXy3u","hqqbBi3M3BaCY6ivH","optQ3PYGE2PxhriFJ","sg6yZ29Z2xB5xP79R","T3oedZczBnZ2Y6GvJ","jHtiDocCziH83gWEu","uKBTF27RvvtN9Ryxw"]}