. "Strej\u010Dek, Jan" . "P(GA201/00/0400), P(GA201/00/1023), Z(MSM 143300001)" . "1"^^ . "(rewrite) transition system; concurrency; partial information; bisimulation equivalence; language expressibility"@en . "P\u0159episovac\u00ED syst\u00E9my s omezen\u00EDmi"@cs . "RIV/00216224:14330/00:00002662" . . . "Constrained Rewrite Transition Systems"@en . . "Roz\u0161\u00ED\u0159ujeme p\u0159episovac\u00ED syst\u00E9my o mechanismus pro pr\u00E1ci s \u010D\u00E1ste\u010Dnou informac\u00ED v analogick\u00E9 podob\u011B jako v Concurrent Constraint Programming (CCP). Roz\u0161\u00ED\u0159en\u00ED zm\u011Bn\u00ED vyjad\u0159ovac\u00ED s\u00EDlu t\u0159\u00EDd p\u0159echodov\u00FDch syst\u00E9m\u016F BPA a BPP a vzniknou tak dv\u011B nov\u00E9 t\u0159\u00EDdy p\u0159echodov\u00FDch syst\u00E9m\u016F (fcBPA a fcBPP). Roz\u0161\u00ED\u0159en\u00ED nezm\u011Bn\u00ED vyjad\u0159ovac\u00ED s\u00EDlu ostatn\u00EDch uva\u017Eovan\u00FDch t\u0159\u00EDd (FSA, PDA, PPDA, a PN). Nov\u011B vznikl\u00E9 t\u0159\u00EDdy jsou za\u0159azeny do hierarchie standardn\u00EDch t\u0159\u00EDd p\u0159echodov\u00FDch syst\u00E9m\u016F navr\u017Een\u00E9 Mollerem [Mol96]."@cs . "RIV/00216224:14330/00:00002662!RIV09-GA0-14330___" . . "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]." . "[91CF81121D29]" . . "14330" . . . . "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" . "Report Series, FIMU-RS-2000-12" . "http://www.fi.muni.cz/reports/files/older/FIMU-RS-2000-12.pdf" . . . . "707456" . "Constrained Rewrite Transition Systems"@en . "Constrained Rewrite Transition Systems" . "FI MU" . . . . . . . "Brno" . "1"^^ . . . "P\u0159episovac\u00ED syst\u00E9my s omezen\u00EDmi"@cs . .