Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
From MaRDI portal
Publication:5166706
DOI10.1007/978-3-319-02444-8_32zbMath1410.68231OpenAlexW4235354203MaRDI QIDQ5166706
Jan Křetínský, Ruslán Ledesma Garza
Publication date: 8 July 2014
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-02444-8_32
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (9)
From LTL to deterministic automata. A safraless compositional approach ⋮ Generic Emptiness Check for Fun and Profit ⋮ Optimal Translation of LTL to Limit Deterministic Automata ⋮ Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) ⋮ Functional Encryption for Inner Product with Full Function Privacy ⋮ Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach ⋮ Rabinizer ⋮ Efficient Analysis of Probabilistic Programs with an Unbounded Counter ⋮ Back to the future: a fresh look at linear temporal logic
Uses Software
This page was built for publication: Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
