Adaptive Reactive Synthesis for LTL and LTLf Modulo Theories

被引:0
|
作者
Rodriguez, Andoni [1 ,2 ]
Sanchez, Cesar [1 ]
机构
[1] IMDEA Software Inst, Madrid, Spain
[2] Univ Politecn Madrid, Madrid, Spain
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reactive synthesis is the process of generate correct controllers from temporal logic specifications. Typically, synthesis is restricted to Boolean specifications in LTL. Recently, a Boolean abstraction technique allows to translate LTLT specifications that contain literals in theories into equi-realizable LTL specifications, but no full synthesis procedure exists yet. In synthesis modulo theories, the system receives valuations of environment variables (from a first-order theory T) and outputs valuations of system variables from T. In this paper, we address how to syntheize a full controller using a combination of the static Boolean controller obtained from the Booleanized LTL specification together with on-the-fly queries to a solver that produces models of satisfiable existential T formulae. This is the first synthesis method for LTL modulo theories. Additionally, our method can produce adaptive responses which increases explainability and can improve runtime properties like performance. Our approach is applicable to both LTL modulo theories and LTLf modulo theories.
引用
下载
收藏
页码:10679 / 10686
页数:8
相关论文
共 50 条
  • [1] Reactive Synthesis Modulo Theories using Abstraction Refinement
    Maderbacher, Benedikt
    Bloem, Roderick
    2022 FORMAL METHODS IN COMPUTER-AIDED DESIGN, FMCAD, 2022, 3 : 315 - 324
  • [2] Two-Stage Technique for LTLf Synthesis Under LTL Assumptions
    De Giacomo, Giuseppe
    Di Stasio, Antonio
    Vardi, Moshe Y.
    Zhu, Shufang
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 304 - 314
  • [3] LTL Reactive Synthesis with a Few Hints
    Balachander, Mrudula
    Filiot, Emmanuel
    Raskin, Jean-Francois
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2023, 2023, 13994 : 309 - 328
  • [4] LTL Reactive Synthesis under Assumptions
    Aminof, Benjamin
    De Giacomo, Giuseppe
    Murano, Aniello
    Patrizi, Fabio
    Rubin, Sasha
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (218): : 52 - +
  • [5] LTL transformation modulo positive transitions
    Bourahla, Mustapha
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2017, 11 (06): : 205 - 213
  • [6] Symbolic LTLf Synthesis
    Zhu, Shufang
    Tabajara, Lucas M.
    Li, Jianwen
    Pu, Geguang
    Vardi, Moshe Y.
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1362 - 1369
  • [7] Counterexample Guided Inductive Synthesis Modulo Theories
    Abate, Alessandro
    David, Cristina
    Kesseli, Pascal
    Kroening, Daniel
    Polgreen, Elizabeth
    COMPUTER AIDED VERIFICATION (CAV 2018), PT I, 2018, 10981 : 270 - 288
  • [8] End-to-End Learning of LTL f Formulae by Faithful LTLf Encoding
    Wan, Hai
    Liang, Pingjia
    Du, Jianfeng
    Luo, Weilin
    Ye, Rongzhen
    Peng, Bo
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 9071 - 9079
  • [9] Strong Fully Observable Non-Deterministic Planning with LTL and LTLf Goals
    Camacho, Alberto
    McIlraith, Sheila A.
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 5523 - 5531
  • [10] LTLf Synthesis on Probabilistic Systems
    Wells, Andrew M.
    Lahijanian, Morteza
    Kavraki, Lydia E.
    Vardi, Moshe Y.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (326): : 166 - 181