31 citations · 56 across the 19 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.LO2014★ 2 cited
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME
Wojciech Czerwiński, Petr Jančar
Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a si…
cs.LO2014
On Reachability for Unidirectional Channel Systems Extended with Regular Tests
Jancar Petr, Prateek Karandikar, Philippe Schnoebelen
"Unidirectional channel systems" (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and on…
cs.LO2014
Bisimulation Equivalence of First-Order Grammars
Petr Jancar
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence gen…