Constrained Rewrite Transition Systems

Investor logo
Investor logo

Warning

This publication doesn't include Faculty of Sports Studies. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

STREJČEK Jan

Year of publication 2000
Type R&D Presentation
MU Faculty or unit

Faculty of Informatics

Citation
Description 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].
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info