Other formats:
BibTeX
LaTeX
RIS
@inproceedings{557472,
author = {Křetínský, Mojmír and Řehák, Vojtěch and Strejček, Jan},
address = {Berlin, Heidelberg, New York},
booktitle = {CONCUR 2004 - Concurrency Theory},
edition = {LNCS 3170},
keywords = {process rewrite systems; state extension; infinite-state; expressivness; reachability; decidability},
language = {eng},
location = {Berlin, Heidelberg, New York},
isbn = {3-540-22940-X},
pages = {355-370},
publisher = {Springer},
title = {Extended Process Rewrite Systems: Expressiveness and Reachability},
year = {2004}
}
TY - JOUR
ID - 557472
AU - Křetínský, Mojmír - Řehák, Vojtěch - Strejček, Jan
PY - 2004
TI - Extended Process Rewrite Systems: Expressiveness and Reachability
PB - Springer
CY - Berlin, Heidelberg, New York
SN - 354022940X
KW - process rewrite systems
KW - state extension
KW - infinite-state
KW - expressivness
KW - reachability
KW - decidability
N2 - 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 expressible up to bisimulation 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.
ER -
KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Extended Process Rewrite Systems: Expressiveness and Reachability. In \textit{CONCUR 2004 - Concurrency Theory}. LNCS 3170. Berlin, Heidelberg, New York: Springer, 2004, p.~355-370. ISBN~3-540-22940-X.
|
