34 citations · 60 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
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…
cs.LO2012★ 34 cited
Reachability Analysis of Communicating Pushdown Systems
Alexander Heussner, Jérôme Leroux, Anca Muscholl +1
The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characte…