The following pages link to Flat Parametric Counter Automata (Q5901227):
Displayed 13 items.
- On the solvability of a class of Diophantine equations and applications (Q818150) (← links)
- Algebraic program analysis (Q832153) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Dense-choice counter machines revisited (Q2015129) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Iterating Octagons (Q3617767) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- Automatic Verification of Counter Systems With Ranking Function (Q5179052) (← links)
- Acceleration in Convex Data-Flow Analysis (Q5458862) (← links)