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) where the regularity is also decidable. Moreover, constructiveness of this result implies decidability of bisimilarity for pairs of processes such that one process of this pair is sPA and the other has finitely many states.
منابع مشابه
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.
متن کامل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 Weak Bisimilarity And Regularity For Bpa And Bpp
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound for BPP have been demonstrated by Stribrna. Mayr achieved recently a result, saying that weak bisimilarity for BPP is Π2 -hard. We improve this lower bound to PSPACE, moreover for the restricted class of normed BPP. Weak...
متن کامل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...
متن کاملOn the Complexity of Deciding Behavioural Equivalences and Preorders A Survey
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinite-state BPA [BK84b] processes. A distinction, which turns out to be important in the finite-state processes, is that of simulation-like eq...
متن کامل