Visualisation of distributed algorithms based on graph relabelling systems
Visualisation of distributed algorithms based on graph relabelling systems
In this paper, we present a uniform approach to simulate and visualize distributed algorithms encoded by graph relabelling systems. In particular, we use the distributed applications of local relabelling rules to automatically display the execution of the whole distributed algorithm. We have developed a Java prototype tool for implementing and visualizing distributed algorithms. We illustrate the different aspects of our framework using various distributed algorithms including election and spanning trees.
from: Electronic Notes in Theoretical Computer Science Vol.50 No.3
0444510664
Bauderon, M.
804ca21a-058c-4146-9eb3-f3b6b0189160
Gruner, S.
66ccd82a-f66d-4b87-8894-60303019064b
Metivier, Y.
91373609-4401-4cf3-937d-ad59f423e174
Mosbah, M.
76999736-f2f1-4278-b9b4-43831aaf6532
Sellami, A.
91e45c37-a41c-4ae5-b441-7f4c5ed0eb2d
Baresi, L.
685f61ae-0297-4de6-852c-9047ccfb8d1b
Pezze, M.
d95df94f-5e46-481a-a92f-350269584360
Taentzer, G.
50a510fe-96df-4b02-ab05-bb79a26bd27f
Zaroliagis, C.
44a5b214-4ad5-42f9-b8cd-4cf1c2601178
2001
Bauderon, M.
804ca21a-058c-4146-9eb3-f3b6b0189160
Gruner, S.
66ccd82a-f66d-4b87-8894-60303019064b
Metivier, Y.
91373609-4401-4cf3-937d-ad59f423e174
Mosbah, M.
76999736-f2f1-4278-b9b4-43831aaf6532
Sellami, A.
91e45c37-a41c-4ae5-b441-7f4c5ed0eb2d
Baresi, L.
685f61ae-0297-4de6-852c-9047ccfb8d1b
Pezze, M.
d95df94f-5e46-481a-a92f-350269584360
Taentzer, G.
50a510fe-96df-4b02-ab05-bb79a26bd27f
Zaroliagis, C.
44a5b214-4ad5-42f9-b8cd-4cf1c2601178
Bauderon, M., Gruner, S., Metivier, Y., Mosbah, M. and Sellami, A.
(2001)
Visualisation of distributed algorithms based on graph relabelling systems.
Baresi, L., Pezze, M., Taentzer, G. and Zaroliagis, C.
(eds.)
2nd International Workshop on Graph Transformation and Visual Modelling Techniques (Satellite Event of ICALP 2001), , Heraklion, Greece.
01 Jan 2001.
Record type:
Conference or Workshop Item
(Other)
Abstract
In this paper, we present a uniform approach to simulate and visualize distributed algorithms encoded by graph relabelling systems. In particular, we use the distributed applications of local relabelling rules to automatically display the execution of the whole distributed algorithm. We have developed a Java prototype tool for implementing and visualizing distributed algorithms. We illustrate the different aspects of our framework using various distributed algorithms including election and spanning trees.
from: Electronic Notes in Theoretical Computer Science Vol.50 No.3
This record has no associated files available for download.
More information
Published date: 2001
Additional Information:
Organisation: EATCS Address: Amsterdam
Venue - Dates:
2nd International Workshop on Graph Transformation and Visual Modelling Techniques (Satellite Event of ICALP 2001), , Heraklion, Greece, 2001-01-01 - 2001-01-01
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 255989
URI: http://eprints.soton.ac.uk/id/eprint/255989
ISBN: 0444510664
PURE UUID: 5a647c92-308b-4253-976d-6fb9831b6374
Catalogue record
Date deposited: 05 Jul 2002
Last modified: 10 Dec 2021 20:40
Export record
Contributors
Author:
M. Bauderon
Author:
S. Gruner
Author:
Y. Metivier
Author:
M. Mosbah
Author:
A. Sellami
Editor:
L. Baresi
Editor:
M. Pezze
Editor:
G. Taentzer
Editor:
C. Zaroliagis
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics