Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\)

DOI10.1007/978-3-662-46681-0_57zbMath1420.68132OpenAlexW2405166594MaRDI QIDQ2272912

Dileep Kini, Mahesh Viswanathan

Publication date: 17 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-662-46681-0_57

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

Certified reinforcement learning with logic guidance ⋮ From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata ⋮ Optimal Translation of LTL to Limit Deterministic Automata ⋮ Functional Encryption for Inner Product with Full Function Privacy

This page was built for publication: Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\)