. "30"^^ . . "14330" . . "[2F7CB0636553]" . "Constrained Rewrite Transition Systems" . "707457" . "Constrained Rewrite Transition Systems" . "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]."@en . "Constrained Rewrite Transition Systems"@en . . . "Strej\u010Dek, Jan" . . "1"^^ . . "0"^^ . "RIV/00216224:14330/00:00002662" . "1"^^ . "0"^^ . "Constrained Rewrite Transition Systems"@en . . . . "RIV/00216224:14330/00:00002662!RIV/2002/GA0/143302/N" . "Masarykova univerzita. Fakulta informatiky" . . . "Brno" . . . . "(rewrite) transition system, concurrency, partial information, bisimulation equivalence, language expressibility"@en . "Constrained Rewrite Transition Systems" . . "30"^^ . "Technical Report FIMU-RS-2000-12" . . . "P(GA201/00/0400), P(GA201/00/1023), Z(MSM 143300001)" . . . "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]." .