On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

Investor logo

Warning

This publication doesn't include Faculty of Arts. 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 INFINITY'2003: 5th International Workshop on Verification of Infinite-State Systems
MU Faculty or unit

Faculty of Informatics

Citation
Web http://dx.doi.org/10.1016/j.entcs.2003.10.008
Field Informatics
Keywords process rewrite systems; state extension; infinite-state; decidability; reachability
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.
Related projects:

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