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

Nummer

Nr. 7 (2004): RS-7 On the Expressive Power of Extended Process Rewrite Systems

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).