Rabinizer

swMATH21008MaRDI QIDQ32821FDOQ32821

Author name not available (Why is that?)

Described by source

• Rabinizer 3: Safraless translation of LTL to small deterministic automata
• Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
• Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)

Cited In (14)

• Extending fairness expressibility of ECTL\(^+\): a tree-style one-pass tableau approach
• Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
• A Unified Translation of Linear Temporal Logic to ω-Automata
• One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata
• Efficient analysis of probabilistic programs with an unbounded counter
• Model checking probabilistic systems
• Back to the future: a fresh look at linear temporal logic
• Generic emptiness check for fun and profit
• Index appearance record for transforming Rabin automata into parity automata
• Index appearance record with preorders
• Limit-deterministic Büchi automata for linear temporal logic
• Optimal Translation of LTL to Limit Deterministic Automata
• From LTL to deterministic automata. A safraless compositional approach
• Title not available (Why is that?)

This page was built for software: Rabinizer