On parametric timed automata and one-counter machines
From MaRDI portal
Publication:515666
DOI10.1016/J.IC.2016.07.011zbMATH Open1362.68131OpenAlexW2513871081MaRDI QIDQ515666FDOQ515666
Authors: 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
Recommendations
- scientific article; zbMATH DE number 7559498
- On the expressiveness of parametric timed automata
- Branching-time model checking of parametric one-counter automata
- Reachability in Succinct and Parametric One-Counter Automata
- Model-Checking One-Clock Priced Timed Automata
- Model checking succinct and parametric one-counter automata
- Model Checking One-clock Priced Timed Automata
- A theory of timed automata
- On implementable timed automata
- Universality analysis for one-clock timed automata
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- What good are digital clocks?
- On the complexity of linear arithmetic with divisibility
- Reachability in two-clock timed automata is PSPACE-complete
- Title not available (Why is that?)
- Parametric real-time reasoning
- Title not available (Why is that?)
- Term Rewriting and Applications
- Model checking succinct and parametric one-counter automata
- Advances in Parametric Real-Time Reasoning
- Integer Parameter Synthesis for Timed Automata
- Decidability of the universal theory of natural numbers with addition and divisibility
- Reachability in Succinct and Parametric One-Counter Automata
- Title not available (Why is that?)
- The Diophantine Problem for Addition and Divisibility
- Title not available (Why is that?)
- New decidability results concerning two-way counter machines and applications
- On the relationship between reachability problems in timed and counter automata
- CONCUR 2004 - Concurrency Theory
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- Robust parametric reachability for timed automata
Cited In (17)
- Reachability in two-clock timed automata is PSPACE-complete
- On the relationship between reachability problems in timed and counter automata
- Relating reachability problems in timed and counter automata
- Flat Parametric Counter Automata
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
- Reachability in timed counter systems
- Reachability in Succinct and Parametric One-Counter Automata
- Continuous One-counter Automata
- The complexity of flat freeze LTL
- The complexity of flat freeze LTL
- An algorithm for single-source shortest paths enumeration in parameterized weighted graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Flat Parametric Counter Automata
- Title not available (Why is that?)
- Robust parametric reachability for timed automata
This page was built for publication: On parametric timed automata and one-counter machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515666)
