Extended Process Rewrite Systems: Expressiveness and Reachability

Investor logo

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KŘETÍNSKÝ Mojmír ŘEHÁK Vojtěch STREJČEK Jan

Year of publication 2004
Type Article in Proceedings
Conference CONCUR 2004 - Concurrency Theory
MU Faculty or unit

Faculty of Informatics

Citation
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 class of Petri nets is less expressible up to bisimulation than the class of PA processes extended with a finite state control unit. Further we show our main result 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.