8 citations · 15 across the 4 of their papers we have counts for
Showing cs.LOShow all
2 papers · 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…
cs.LO2012★ 6 cited
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Alexandre David, Lasse Jacobsen, Morten Jacobsen +1
Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We pres…