On the Expressive Power of Extended Process Rewrite Systems

@inproceedings{Kretnsk2004OnTE,
  title={On the Expressive Power of Extended Process Rewrite Systems},
  author={Mojm{\'i}r Kret{\'i}nsk{\'y} and Vojtech Reh{\'a}k and Jan Strejcek},
  year={2004}
}
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. 

Figures from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

Process Rewrite Systems

  • Inf. Comput.
  • 1999
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Process Rewrite Systems with Weak Finite-State Unit by Mojmír Křetínský Vojtěch

Mojmı́r Křetı́nský, Vojtěch Řehák, Jan Strejček
  • 2003
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Concurrent constraint programming

  • POPL '90
  • 1989
VIEW 1 EXCERPT
HIGHLY INFLUENTIAL

Mosses . Composing Programming Languages by Combining ActionSemantics Modules

Kyung-Goo Doh, D. Peter
  • 2003

Schnoebelen . The regular viewpoint on PAprocesses

Ph.
  • 2003

Grammars as Processes

  • Formal and Natural Computing
  • 2002
VIEW 2 EXCERPTS