Graph transformation for domain-specific discrete event time simulation
Entity
UAM. Departamento de Ingeniería InformáticaPublisher
Springer Berlin HeidelbergDate
2010Citation
10.1007/978-3-642-15928-2_18
Graph Transformations: 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27–October 2, 2010. Proceedings. Lecture Notes in Computer Science, Volumen 6372. Springer, 2010. 266-281
ISSN
0302-9743 (print); 1611-3349 (online)ISBN
978-3-642-15927-5 (print); 978-3-642-15928-2 (online)DOI
10.1007/978-3-642-15928-2_18Funded by
Work partially sponsored by the Spanish Ministry of Science and Innovation, under project “METEORIC” (TIN2008-02081) and mobility grants JC2009-00015 and PR2009-0019, as well as by the R&D programme of the Community of Madrid, project “e-Madrid” (S2009/TIC-1650). We are grateful to the anonymous reviewers, which helped in improving the paperProject
Comunidad de Madrid. S2009/TIC-1650/E-MADRIDEditor's Version
http://dx.doi.org/10.1007/978-3-642-15928-2_18Subjects
Discrete Mathematics in Computer Science; Software Engineering; Data Structures; Logics and Meanings of Programs; Algorithm Analysis and Problem Complexity; Mathematical Logic; Formal Languages; InformáticaNote
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-15928-2_18Proceedings of 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27–October 2, 2010
Rights
© Springer-Verlag Berlin Heidelberg 2010Abstract
Graph transformation is being increasingly used to express the semantics of domain specific visual languages since its graphical nature makes rules intuitive. However, many application domains require an explicit handling of time in order to represent accurately the behaviour of the real system and to obtain useful simulation metrics.
Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose a novel way of adding explicit time to graph transformation rules. In particular, we take the event scheduling discrete simulation world view and incorporate to the rules the ability of scheduling the occurrence of other rules in the future. Hence, our work combines standard, efficient techniques for discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches.
Files in this item
Google Scholar:Lara Jaramillo, Juan de
-
Guerra Sánchez, Esther
-
Boronat, Artur
-
Heckel, Reiko
-
Torrini, Paolo
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.