Time: Thrusday 04.12.2003, 14:30
Place: room C3-204, Fr. Bajersvej 7
Various classes of infinite-state processes are often specified by rewrite systems. This talk will focus on Mayr's Process Rewrite Systems and its extensions with controlling units. We recall state extended PRS, PRS with finite constraint system, and PRS with weak finite-state unit (wPRS). We will classify these models by their expressiveness and show how their classes are related with respect to bisimilarity. We will conclude with an outline of the proof that the reachability problem for wPRS is decidable.