Sciweavers

Share
CONCUR
2004
Springer

Extended Process Rewrite Systems: Expressiveness and Reachability

11 years 9 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. 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 expressive up to bisimulation equivalence 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.
Mojmír Kretínský, Vojtech Reh
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where CONCUR
Authors Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
Comments (0)
books