Computing linear arithmetic representation of reachability relation of one-counter automata

DOI10.1007/978-3-030-62822-2_6MaRDI QIDQ2169112zbMATH OpenOpenAlexFDO

Authors Xie Li, Taolue Chen, Zhilin Wu, Mingji Xia

Publication date 1 September 2022

Full work available at URL https://doi.org/10.1007/978-3-030-62822-2_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Reachability in Succinct and Parametric One-Counter Automata
• Branching-time model checking of one-counter processes and timed automata
• Iterating Octagons
• One-counter automata with counter observability
• The complexity of regular abstractions of one-counter languages

Cited in

(2)

• One-counter automata with counter observability
• Invariants for one-counter automata with disequality tests

This page was built for publication: Computing linear arithmetic representation of reachability relation of one-counter automata

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