Abstract
Many formal models for infinite state concurrent systems can be expressed by special classes of rewrite systems. We classify these models by their expressiveness and define a hierarchy of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence.The most general and most expressive class of systems in this hierarchy is called “Process Rewrite Systems” (PRS). They subsume Petri nets, PA-Processes and pushdown processes and are strictly more expressive than any of these. PRS are not Turing-powerful, because the reachability problem is still decidable. It is even decidable if there is a reachable state that satisfies certain properties that can be encoded in a simple logic.PRS are more expressive than Petri nets, but not Turing-powerful.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call