pith. machine review for the scientific record. sign in

Title resolution pending

Renkin, F · 2020 · DOI 10.1007/978-3-030-59152-6

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.FL 2

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Fast Obligation Translation and Synthesis

cs.FL · 2026-05-12 · unverdicted · novelty 6.0

Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.

Extending QuAK with Nested Quantitative Automata

cs.FL · 2026-05-12 · unverdicted · novelty 4.0

Extends QuAK with flattening reductions from nested quantitative automata to quantitative automata, enabling analysis of unbounded quantitative properties via existing decision procedures.

citing papers explorer

Showing 2 of 2 citing papers.

  • Fast Obligation Translation and Synthesis cs.FL · 2026-05-12 · unverdicted · none · ref 65

    Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.

  • Extending QuAK with Nested Quantitative Automata cs.FL · 2026-05-12 · unverdicted · none · ref 23

    Extends QuAK with flattening reductions from nested quantitative automata to quantitative automata, enabling analysis of unbounded quantitative properties via existing decision procedures.