Modelling and analysis of distributed simulation protocols with distributed graph transformation
Entity
UAM. Departamento de Ingeniería InformáticaPublisher
Institute of Electrical and Electronics EngineersDate
2005Citation
10.1109/ACSD.2005.27
ACSD 2005. Fifth International Conference on Application of Concurrency to System Design, 2005. IEEE, 2005. 144-153
ISSN
1550-4808ISBN
0-7695-2363-3DOI
10.1109/ACSD.2005.27Funded by
This work has been sponsored by the SEGRAVIS network and the Spanish Ministry of Science and Technology (TIC2002-01948)Editor's Version
http://dx.doi.org/10.1109/ACSD.2005.27Subjects
Discrete Event Simulation; Distributed Graph Transformation; Distributed Simulation; Protocols; InformáticaNote
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. J. de Lara, and G. Taentzer, "Modelling and analysis of distributed simulation protocols with distributed graph transformation", ACSD 2005 Fifth International Conference on Application of Concurrency to System Design, 2005, St. Malo, France, 2005, pp. 144-153Rights
© 2005 IEEEAbstract
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed graph transformation to describe a conservative simulation protocol. We use local control flows for rule execution in each process, as the use of a global control would imply a completely synchronized evolution of all processes. These are specified by a Statechart in which transitions are labelled with rule executions. States are encoded as process attributes, in such a way that rules are only applicable if the process is in a particular state. For the analysis, we introduce a flattening construction as a functor from distributed to normal graphs. Global consistency conditions can be defined for normal graphs which specify safety properties for the protocol. Once the flattening construction is applied to each rule, the global conditions can then be translated into pre-conditions for the protocol rules, which ensure that the protocol fulfils the global constraints in any possible execution. Finally, the paper also discusses tool support using the AToM3 environment.
Files in this item
Google Scholar:Lara Jaramillo, Juan de
-
Taentzer, Gabriele
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.