Comparison of LTL to Deterministic Rabin Automata Translators

DOI10.1007/978-3-642-45221-5_12MaRDI QIDQ2870123zbMATH OpenOpenAlexFDO

Authors František Blahoudek, Jan Strejček, Mojmír Křetínský

Publication date 17 January 2014

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45221-5_12

Mathematics Subject Classification ID

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

Recommendations

• Geometric arbitrage theory and market dynamics
• The Black–Scholes equation in the presence of arbitrage
• Arbitrage Theory: A Mathematical Introduction
• A mathematical theory of financial bubbles
• Arbitrage theory with state-price deflators

Cited in

(10)

• From LTL to deterministic automata. A safraless compositional approach
• Model checking probabilistic systems
• Quantitative verification and strategy synthesis for stochastic games
• From LTL and limit-deterministic Büchi automata to deterministic parity automata
• Optimal Translation of LTL to Limit Deterministic Automata
• Rabinizer 3: Safraless translation of LTL to small deterministic automata
• Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
• Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment
• Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
• The Black–Scholes equation in the presence of arbitrage

Describes a project that uses

Uses Software

• BEEM

This page was built for publication: Comparison of LTL to Deterministic Rabin Automata Translators

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