Abstract
A process Δ is regular if it is bisimilar to a process Δ′ with finitely many states. We prove that regularity of normed PA processes is decidable and we present a practically usable polynomial-time algorithm. Moreover, if the tested normed PA process Δ is regular then the process Δ′ can be effectively constructed. It implies decidability of bisimulation equivalence for any pair of processes such that one process of this pair is a normed PA process and the other process has finitely many states.
Cite
CITATION STYLE
Kučera, A. (1996). Regularity is decidable for normed PA processes in polynomial time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 111–122). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
