Continuous One-counter Automata

DOI10.1145/3558549OpenAlexW3123946441MaRDI QIDQ5875944

Filip Mazowiecki, Tim Leys, Michael Blondin, Guillermo A. Pérez, Philip Offtermatt

Publication date: 7 February 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.11996

zbMATH Keywords

continuous relaxationreachability problemcounter automataparametric automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On parametric timed automata and one-counter machines
• Programs with lists are counter automata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Real addition and the polynomial hierarchy
• Reachability in two-clock timed automata is PSPACE-complete
• Reachability in Succinct and Parametric One-Counter Automata
• New decidability results concerning two-way counter machines and applications
• On the Relationship between Reachability Problems in Timed and Counter Automata
• The reachability problem for Petri nets is not elementary
• Parametric real-time reasoning
• CONCUR 2004 - Concurrency Theory
• Computational Complexity