research
∙
04/27/2023
Multiplicity Problems on Algebraic Series and Context-Free Grammars
In this paper we obtain complexity bounds for computational problems on ...
share
research
∙
12/30/2020
Reachability relations of timed pushdown automata
Timed pushdown automata (TPDA) are an expressive formalism combining rec...
research
∙
07/02/2019
Timed Basic Parallel Processes
Timed basic parallel processes (TBPP) extend communication-free Petri ne...
research
∙
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...
research
∙
04/20/2018
Decidability of Timed Communicating Automata
We study the reachability problem for networks of timed communicating pr...
research
∙
11/27/2017
