Sciweavers

IANDC
2010
79views more  IANDC 2010»
13 years 9 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
CONCUR
2003
Springer
14 years 4 months ago
Deciding Bisimilarity between BPA and BPP Processes
We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given B...
Petr Jancar, Antonín Kucera, Faron Moller