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

Warning

This publication doesn't include Faculty of Sports Studies. 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	2003
Type	Article in Proceedings
Conference	Prelim.Proc.of the 5th Internat.Workshop on Verification of Infinite-State Systems (INFINITY'2003)
MU Faculty or unit	Faculty of Informatics
Citation
Field	Informatics
Keywords	process rewrite systems; state extension; infinite-state
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:	Verification of infinite-state systems Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing