STREJČEK, Jan. Rewrite Systems with Constraints. In EXPRESS'01 the 8th International Workshop on Expressiveness in Concurrency. Aalborg (Denmark): Elsevier Science, 2001, p. 1-20.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Rewrite Systems with Constraints
Name in Czech Přepisovací systémy s omezeními
Authors STREJČEK, Jan (203 Czech Republic, guarantor).
Edition Aalborg (Denmark), EXPRESS'01 the 8th International Workshop on Expressiveness in Concurrency, p. 1-20, 2001.
Publisher Elsevier Science
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20206 Computer hardware and architecture
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/01:00004676
Organization unit Faculty of Informatics
Keywords in English (rewrite) transition system; concurrency; partial information; bisimulation equivalence; language expressibility
Tags (rewrite) transition system, bisimulation equivalence, concurrency, language expressibility, partial information
Changed by Changed by: prof. RNDr. Jan Strejček, Ph.D., učo 3366. Changed: 10/1/2005 15:31.
Abstract
We extend a widely used concept of rewrite systems with a unit holding a kind of global information which can influence and can be influenced by rewriting. The unit is similar to the store used in concurrent constraint programming, and can be also seen as a special (weak) state unit. We present how this extension changes the expressive power of rewrite systems classes which are included in Mayr's PRS hierarchy [8]. The new classes (fcBPA, fcBPP, fcPA, fcPAD, fcPAN, fcPRS) are described and inserted into the hierarchy.
Abstract (in Czech)
Známý koncept přepisovacích systémů rozšiřujeme o jednotku obsahující globální informaci, která může ovlivňovat přepisování a být jím ovlivněna. Tato jednotka je podobná jednotce "store" používané v Concurrent Constraint Programming a může být také chápána jako slabá stavová jednotka. Zkoumáme jak popsané rozšíření změní vyjadřovací sílu tříd zahrnutých v Mayerově hierarchii přepisovacích systémů. Nové třídy fcBPA, fcBPP, fcPA, fcPAD, fcPAN, fcPRS jsou vloženy do zmíněné hierarchie.
Links
GA201/00/0400, research and development projectName: Nekonečně stavové souběžné systémy - modely a verifikace
Investor: Czech Science Foundation, Infinite state concurrent systems - models and verification
MSM 143300001, plan (intention)Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů
Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
PrintDisplayed: 26/4/2024 13:02