Publication details

Reachability for Extended Process Rewrite Systems

Investor logo

ŘEHÁK Vojtěch

Year of publication 2004
Type Article in Proceedings
Conference MOVEP'04: 6th school on MOdeling and VErifying parallel Processes
MU Faculty or unit

Faculty of Informatics

Field Informatics
Keywords process rewrite systems; state extension; infinite-state; expressivness; reachability; decidability
Description We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the reachability problem for PRS extended with a so called weak finite state unit is decidable.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info