Abstract
A process is prime if it cannot be decomposed into a parallel product of nontrivial processes. We characterize all non-prime normed BPA processes together with their decompositions by means of normal forms which are designed in this paper. Using this result we demonstrate decidability of the problem whether a given normed BPA process is prime; moreover, we show that non-prime normed BPA processes can be decomposed into primes effectively. This brings other positive decidability results. Finally, we prove that bisimilarity is decidable in a large subclass of normed PA processes.KeywordsNormal FormParallel CompositionReachable StateProcess ExpressionUnique DecompositionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
