Synthesis problems for one-counter automata

DOI10.1007/978-3-319-24537-9_9MaRDI QIDQ1675152zbMATH OpenOpenAlexFDO

Authors Antonia Lechner

Publication date 27 October 2017

Full work available at URL https://doi.org/10.1007/978-3-319-24537-9_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) First-order arithmetic and fragments (03F30)

Recommendations

• LTL parameter synthesis of parametric timed automata
• Parameterized synthesis
• Reachability in Succinct and Parametric One-Counter Automata
• Model checking succinct and parametric one-counter automata
• Parameterized Synthesis

Cited in

(3)

• Positive existential Definability with unit, addition and coprimeness
• One-counter automata for parsing and language approximation
• Problems of synthesis of -automata specified in languages LP and LF of first order logic

This page was built for publication: Synthesis problems for one-counter automata

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