On parametric timed automata and one-counter machines
From MaRDI portal
(Redirected from Publication:515666)
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
- scientific article; zbMATH DE number 1701759 (Why is no real title available?)
- scientific article; zbMATH DE number 3782959 (Why is no real title available?)
- scientific article; zbMATH DE number 1956642 (Why is no real title available?)
- scientific article; zbMATH DE number 1444359 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A theory of timed automata
- Advances in Parametric Real-Time Reasoning
- CONCUR 2004 - Concurrency Theory
- Decidability of the universal theory of natural numbers with addition and divisibility
- Integer Parameter Synthesis for Timed Automata
- Model checking succinct and parametric one-counter automata
- 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
- Parametric real-time reasoning
- Reachability in Succinct and Parametric One-Counter Automata
- Reachability in two-clock timed automata is PSPACE-complete
- Robust parametric reachability for timed automata
- Term Rewriting and Applications
- The Diophantine Problem for Addition and Divisibility
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- What good are digital clocks?
Cited in
(17)- An algorithm for single-source shortest paths enumeration in parameterized weighted graphs
- The complexity of flat freeze LTL
- The complexity of flat freeze LTL
- Relating reachability problems in timed and counter automata
- Reachability in timed counter systems
- On the relationship between reachability problems in timed and counter automata
- Reachability in two-clock timed automata is PSPACE-complete
- scientific article; zbMATH DE number 1670792 (Why is no real title available?)
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
- scientific article; zbMATH DE number 7559494 (Why is no real title available?)
- Flat Parametric Counter Automata
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- scientific article; zbMATH DE number 7566044 (Why is no real title available?)
- Reachability in Succinct and Parametric One-Counter Automata
- Flat Parametric Counter Automata
- Robust parametric reachability for timed automata
- Continuous One-counter 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)
