From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata-Reference-Cited by-同舟云学术

From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata

Published:2022-07-23 Issue:4 Volume:24 Page:635-659
ISSN:1433-2779
Container-title:International Journal on Software Tools for Technology Transfer
language:en
Short-container-title:Int J Softw Tools Technol Transfer

Author:

Esparza Javier,Křetínský Jan,Raskin Jean-François,Sickert Salomon

Abstract

AbstractController synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature.

Funder

Technische Universität München

Publisher

Springer Science and Business Media LLC

Subject

Information Systems,Software

Link

https://link.springer.com/content/pdf/10.1007/s10009-022-00663-1.pdf

Reference40 articles.

1. T, Babiak, Křetínský, M., Rehák, V., Strejcek, J.: LTL to Büchi automata translation: Fast and more deterministic. In: TACAS. LNCS 7214, 95–109 (2012). https://doi.org/10.1007/978-3-642-28756-5_8

2. Blahoudek, F., Heizmann, M., Schewe, S., Strejcek, J., Tsai, M.: Complementing semi-deterministic Büchi automata. In: TACAS. LNCS 9636, 770–787 (2016). https://doi.org/10.1007/978-3-662-49674-9_49

3. Bloem, R., Chatterjee, K., Jobstmann, B.: Graph games and reactive synthesis. In: E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem (eds.) Handbook of Model Checking, pp. 921–962. Springer (2018). https://doi.org/10.1007/978-3-319-10575-8_27

4. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM 42(4), 857–907 (1995). https://doi.org/10.1145/210332.210339

5. Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, E., Xu, L.: Spot 2.0 - A framework for LTL and $$\omega $$-automata manipulation. In: C. Artho, A. Legay, D. Peled (eds.) Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016, Chiba, Japan, October 17-20, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9938, pp. 122–129 (2016). https://doi.org/10.1007/978-3-319-46520-3_8

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

1. COOL 2 – A Generic Reasoner for Modal Fixpoint Logics (System Description);Automated Deduction – CADE 29;2023

2. Guessing Winning Policies in LTL Synthesis by Semantic Learning;Computer Aided Verification;2023