Normed BPA vs. Normed BPP Revisited
نویسندگان
چکیده
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process. This improves the previously known exponential upper bound by Černá, Křet́ınský, Kučera (1999). The algorithm relies on a polynomial bound for the “finite-state core” of the transition system generated by the BPP process. The bound is derived from the “prime form” of the underlying BPP system (where bisimilarity coincides with equality); we suggest an original algorithm for the respective transformation.
منابع مشابه
Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time
We consider the problem of deciding regularity of normed BPP and normed BPA processes. A process is regular if it is bisimilar to a process with finitely many states. We show that regularity of normed BPP and normed BPA processes is decidable in polynomial time and we present constructive regularity tests. Combining these two results we obtain a rich subclass of normed PA processes (called sPA)...
متن کاملWeak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
We prove that weak bisimilarity is decidable in polynomial time between nite-state systems and several classes of innnite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the rst polynomial algorithms for weak bisimilarity problems involving innnite-state systems.
متن کاملPartially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA and BPP. It is derived in the setting of partially-c...
متن کاملBranching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Kučera and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows a...
متن کاملComplexity of deciding bisimilarity between normed BPA and normed BPP
Article history: Available online: 20 June 2010
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008