28 citations · 75 across the 20 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.FL2012★ 4 cited
Advanced Automata Minimization
Lorenzo Clemente, Richard Mayr
We present an efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-comp…
cs.LO2012★ 1 cited
Reachability of Communicating Timed Processes
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer +1
We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over…