Reachability of Hennessy-Milner Properties for Weakly Extended PRS [chapter]

Mojmír Křetínský, Vojtěch Řehák, Jan Strejček
2005 Lecture Notes in Computer Science  
We examine the problem whether a given weakly extended process rewrite system (wPRS) contains a reachable state satisfying a given formula of Hennessy-Milner logic. We show that this problem is decidable. As a corollary we observe that the problem of strong bisimilarity between wPRS and finite-state systems is decidable. Decidability of the same problem for wPRS subclasses, namely PAN and PRS, has been formulated as an open question, see e.g. [Srb02] . We also strengthen some related undecidability results on some PRS subclasses.
doi:10.1007/11590156_17 fatcat:rejc2vclcveshp6idkhh67tg6y