28 citations · 75 across the 20 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.FL2018★ 1 cited
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
Lorenzo Clemente, Sławomir Lasota
We study an expressive model of timed pushdown automata extended with modular and fractional clock constraints. We show that the binary reachability relation is effectively express…
cs.FL2018★ 2 cited
Decidability of Timed Communicating Automata
Lorenzo Clemente
We study the reachability problem for networks of timed communicating processes. Each process is a timed automaton communicating with other processes by exchanging messages over un…