DeepAI
Log In Sign Up

Reachability relations of timed pushdown automata

12/30/2020
by   Lorenzo Clemente, et al.
0

Timed pushdown automata (TPDA) are an expressive formalism combining recursion with a rich logic of timing constraints. We prove that reachability relations of TPDA are expressible in linear arithmetic, a rich logic generalising Presburger arithmetic and rational arithmetic. The main technical ingredients are a novel quantifier elimination result for clock constraints (used to simplify the syntax of TPDA transitions), the use of clock difference relations to express reachability relations of the fractional clock values, and an application of Parikh's theorem to reconstruct the integral clock values.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/28/2018

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms

We study an expressive model of timed pushdown automata extended with mo...
09/28/2020

Reachability for Updatable Timed Automata made faster and more effective

Updatable timed automata (UTA) are extensions of classic timed automata ...
06/07/2020

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities

Clock-dependent probabilistic timed automata extend classical timed auto...
07/02/2019

Timed Basic Parallel Processes

Timed basic parallel processes (TBPP) extend communication-free Petri ne...
12/03/2015

Introduction of the Residue Number Arithmetic Logic Unit With Brief Computational Complexity Analysis

Digital System Research has pioneered the mathematics and design for a n...
06/27/2019

Repairing Timed Automata Clock Guards through Abstraction and Testing

Timed automata (TAs) are a widely used formalism to specify systems havi...
08/19/2019

On the expressive power of invariants in parametric timed automata

The verification of systems combining hard timing constraints with concu...