Publication details
Constrained Rewrite Transition Systems
| Basic information | |
|---|---|
| Original title: | Constrained Rewrite Transition Systems |
| Author: | Jan Strejček |
| Further information | |
|---|---|
| Citation: | STREJČEK, Jan. Constrained Rewrite Transition Systems. Brno : FI MU, 2000. Report Series, FIMU -RS-2000-12.  WWW |
| Original language: | English |
| Field: | Computer hardware and software |
| WWW: | http://www.fi.muni.cz/informatics/reports/ |
| Type: | R&D Presentation |
| Keywords: | (rewrite) transition system; concurrency; partial information; bisimulation equivalence; language expressibility |
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:
- Infinite state concurrent systems - models and verification
- Algorithms and tools for practical verification of concurrent systems.
- Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
