Limit deterministic and probabilistic automata for LTL GU

DOI10.1007/978-3-662-46681-0_57MaRDI QIDQ2272912zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Limit-deterministic Büchi automata for linear temporal logic
• Optimal Translation of LTL to Limit Deterministic Automata
• Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
• Deterministic generators and games for LTL fragments
• From LTL to Symbolically Represented Deterministic Automata

Cited in

(7)

• Functional encryption for inner product with full function privacy
• Deterministic generators and games for LTL fragments
• An optimal automata approach to LTL model checking of probabilistic systems
• From LTL and limit-deterministic Büchi automata to deterministic parity automata
• Limit-deterministic Büchi automata for linear temporal logic
• Optimal Translation of LTL to Limit Deterministic Automata
• Certified reinforcement learning with logic guidance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272912)