Szczegóły publikacji
Opis bibliograficzny
On complexity of coordination of parallel graph transformations in GRADIS framework / Leszek KOTULSKI, Adam SĘDZIWY // W: DepCoS – RELCOMEX'09 : proceedings of International conference on Dependability of Computer Systems : Brunów, Poland, 30 June-2 July, 2009 / eds. Wojciech Zamojski [et al.] ; Institute of Computer Engineering, Control and Robotics. Wrocław University of Technology. — Los Alamitos [et al.] : IEEE Computer Society, cop. 2009. — ISBN: 978-0-7695-3674-3. — S. 279–289. — Bibliogr. s. 286, Abstr.
Autorzy (2)
Dane bibliometryczne
| ID BaDAP | 96360 |
|---|---|
| Data dodania do BaDAP | 2016-02-24 |
| Tekst źródłowy | URL |
| DOI | 10.1109/DepCoS-RELCOMEX.2009.51 |
| Rok publikacji | 2009 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International conference on Dependability and Complex Systems |
Abstract
The graph transformations are very intuitive and precise way of modeling and specifying the systems. A wide range of applications sup-porting the visual modeling techniques, especially in the UML context, are supported by graph transformation techniques. The complementary graphs concept enables applying the distributed and parallel transformations using rules designed for the centralized transfor-mations. This concept is supported by the GRADIS agent framework. The aim of the paper is to prove that in the case of the single pushout transformations, being one of the most popular mechanism of graph transformations - the algorithm of the agents (maintaining local graphs) coordination has polynomial complexity and it is time dependent errors-and deadlock free.
