Regularity of normed PA processes
We prove that regularity of normed PA processes is decidable in polynomial time. As an immediate consequence we also obtain decidability of bisimilarity between normed PA processes and finite-state ones. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
regularity concurrency process algebra