On the Expressive Power of Extended Process Rewrite Systems

Forfattere

  • Mojmír Kretínský
  • Vojtech Rehák
  • Jan Strejcek

DOI:

https://doi.org/10.7146/brics.v11i7.21832

Resumé

We provide a unified view on three extensions of Process rewrite systems (PRS) and compare their and PRS's expressive power. We show that the class of Petri Nets is less expressible up to bisimulation than the class of Process Algebra extended with 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.

Downloads

Publiceret

2004-04-11

Citation/Eksport

Kretínský, M., Rehák, V., & Strejcek, J. (2004). On the Expressive Power of Extended Process Rewrite Systems. BRICS Report Series, 11(7). https://doi.org/10.7146/brics.v11i7.21832