Další formáty:
BibTeX
LaTeX
RIS
@misc{345344, author = {Strejček, Jan}, address = {Brno}, keywords = {(rewrite) transition system; concurrency; partial information; bisimulation equivalence; language expressibility}, language = {eng}, location = {Brno}, publisher = {FI MU}, title = {Constrained Rewrite Transition Systems}, url = {http://www.fi.muni.cz/reports/files/older/FIMU-RS-2000-12.pdf}, year = {2000} }
TY - GEN ID - 345344 AU - Strejček, Jan PY - 2000 TI - Constrained Rewrite Transition Systems VL - Report Series, FIMU-RS-2000-12 PB - FI MU CY - Brno KW - (rewrite) transition system KW - concurrency KW - partial information KW - bisimulation equivalence KW - language expressibility UR - http://www.fi.muni.cz/reports/files/older/FIMU-RS-2000-12.pdf L2 - http://www.fi.muni.cz/reports/files/older/FIMU-RS-2000-12.pdf N2 - We extend broadly studied rewrite transition systems with a mechanism for computing with partial information in the form similar to that one used in Concurrent Constraint Programming (CCP). Two new classes of transition systems (fcBPA and fcBPP) are introduced as this extension changes expressibility power of rewrite transition systems corresponding to BPA and BPP. The power of rewrite systems corresponding to other classes (FSA, PDA, PPDA, and PN) remains unchanged. The new classes are inserted to the hierarchy of standard process classes presented by Moller [Mol96]. ER -
STREJČEK, Jan. \textit{Constrained Rewrite Transition Systems}. Brno: FI MU, 2000. Report Series, FIMU-RS-2000-12.
|