Publication details
Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper)
| Authors | |
|---|---|
| Year of publication | 2003 |
| MU Faculty or unit | |
| Description | Various classes of infinite-state processes are often specified by rewrite systems. We extend Mayr's Process Rewrite Systems (PRS) by finite-state unit whose transition function satisfies some restrictions inspired by weak finite automata. We classify these models by their expressiveness and show how the hierarchy of new classes (w.r.t. bisimilarity) is related to both PRS hierarchy of Mayr and two other hierarchies of PRS extensions. |