Continuous One-counter Automata

DOI10.1145/3558549MaRDI QIDQ5875944zbMATH OpenOpenAlexWikidataFDO

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

Publication date 7 February 2023

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

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

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

zbMATH Keywords

continuous relaxationcounter automataparametric automatareachability problem

Mathematics Subject Classification ID

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

Cites work

• Computational Complexity
• CONCUR 2004 - Concurrency Theory
• scientific article; zbMATH DE number 578252 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Logics for continuous reachability in Petri nets and vector addition systems with states
• New decidability results concerning two-way counter machines and applications
• On parametric timed automata and one-counter machines
• On the relationship between reachability problems in timed and counter automata
• Parametric real-time reasoning
• Programs with lists are counter automata
• Reachability in Succinct and Parametric One-Counter Automata
• Reachability in two-clock timed automata is PSPACE-complete
• Real addition and the polynomial hierarchy
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of flat freeze LTL
• The reachability problem for Petri nets is not elementary

Cited in

(4)

• One-variable context-free hedge automata
• Continuous and monotone machines
• On continuous pushdown VASS in one dimension
• Invariants for one-counter automata with disequality tests

This page was built for publication: Continuous One-counter Automata

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