Decompositions in Compositional Translation of LTLf to DFA (Student Abstract)

AAAI 2024 pp. 23537-23538

doi:10.1609/AAAI.V38I21.30462 /aaai/2024/kankariya2024aaai-decompositions/

Abstract

Prior compositional methods in LTLf to DFA conversion have focussed on improving the composition phase. In this work, we examine improvements to the decomposition phase that result in overall improvements in LTLf to DFA translation. Our work is based on reducing the structure of the underlying Abstract Syntax Tree (AST) of a formula such that the new AST results in fewer composition operations.

PDF AAAI Semantic Scholar

Cite

Text

Kankariya and Bansal. "Decompositions in Compositional Translation of LTLf to DFA (Student Abstract)." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I21.30462

Markdown

[Kankariya and Bansal. "Decompositions in Compositional Translation of LTLf to DFA (Student Abstract)." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/kankariya2024aaai-decompositions/) doi:10.1609/AAAI.V38I21.30462

BibTeX

@inproceedings{kankariya2024aaai-decompositions,
  title     = {{Decompositions in Compositional Translation of LTLf to DFA (Student Abstract)}},
  author    = {Kankariya, Yash and Bansal, Suguman},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {23537-23538},
  doi       = {10.1609/AAAI.V38I21.30462},
  url       = {https://mlanthology.org/aaai/2024/kankariya2024aaai-decompositions/}
}