Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

CONCUR
2003
Springer

favoriteEmaildiscussreport

89views Distributed And Parallel Com...» more CONCUR 2003»

Deciding Bisimilarity between BPA and BPP Processes

14 years 4 months ago

Deciding Bisimilarity between BPA and BPP Processes

Download www.fi.muni.cz

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 BPP, and in the positive case we provide an effective construction for a particular form of one-counter automaton which is bisimilar to the given BPP. This in turn provides the mechanism to decide bisimilarity between a given BPP process and a given BPA process.

Petr Jancar, Antonín Kucera, Faron Moller

Real-time Traffic

BPA Process | BPP Process | CONCUR 2003 | Necessary Condition |

claim paper

Related Content

» Complexity of deciding bisimilarity between normed BPA and normed BPP

» Branching Bisimilarity between FiniteState Systems and BPA or Normed BPP Is PolynomialTime...

» Complexity of Weak Bisimilarity and Regularity for BPA and BPP

» Refining the Undecidability Border of Weak Bisimilarity

» PartiallyCommutative ContextFree Processes

» Deadlocking States in ContextFree Process Algebra

» Simulation Preorder on Simple Process Algebras

» Deciding BisimulationLike Equivalences with FiniteState Processes

» Efficient Verification Algorithms for OneCounter Processes

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CONCUR
Authors	Petr Jancar, Antonín Kucera, Faron Moller

Comments (0)