On parametric timed automata and one-counter machines

DOI10.1016/j.ic.2016.07.011zbMath1362.68131OpenAlexW2513871081MaRDI QIDQ515666

Daniel Bundala, Joël Ouaknine

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:7358d3c4-2b3c-44ad-ad89-6f09495e514a

zbMATH Keywords

reachabilityone-counter machinesparametric timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item, An algorithm for single-source shortest paths enumeration in parameterized weighted graphs, Unnamed Item, Unnamed Item, The Complexity of Flat Freeze LTL, Continuous One-counter Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
• Robust parametric reachability for timed automata
• Decidability of the universal theory of natural numbers with addition and divisibility
• A theory of timed automata
• Advances in Parametric Real-Time Reasoning
• Reachability in Succinct and Parametric One-Counter Automata
• Model Checking Succinct and Parametric One-Counter Automata
• The Diophantine Problem for Addition and Divisibility
• New decidability results concerning two-way counter machines and applications
• On the Complexity of Linear Arithmetic with Divisibility
• On the Relationship between Reachability Problems in Timed and Counter Automata
• What good are digital clocks?
• Parametric real-time reasoning
• CONCUR 2004 - Concurrency Theory
• Integer Parameter Synthesis for Timed Automata
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete
• Term Rewriting and Applications