activity
20092026
most citedTime-Darts: A Data Structure for Verification of Closed Timed Automata

8 citations · 15 across the 6 of their papers we have counts for

collaborators
Showing 2013Show all

1 paper · 1 filter

cs.LO2013★ 1 cited

Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes

Petr Jančar, Jiří Srba

Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by epsilon-free second-order pushdown automata. We add a few remark…