Stochastic analysis of graph transformation systems: A case study in P2P networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3722 LNCS, Issue , 2005, Pages 53-69

  Heckel, Reiko ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER ARCHITECTURE; FORMAL LOGIC; MARKOV PROCESSES; MOBILE TELECOMMUNICATION SYSTEMS; RANDOM PROCESSES;

ARCHITECTURAL RECONFIGURATION; GRAPH TRANSFORMATION; MOBILE SYSTEMS;

GRAPH THEORY;

EID: 33646427707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560647_4     Document Type: Conference Paper

References (26)

1. M. Ajmone-Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Pranceschinis. Modelling with Generalized Stochastic Petri Nets. Wiley Series in Parallel Computing. John Wiley and Sons, 1995.
2. William G. Anderson. Continuous-Time Markov Chains. Springer, 1991.
3. Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, and Joost-Pieter Katoen. Model checking continuous-time markov chains by transient analysis. In Computer Aided Verification, pages 358-372. Springer, 2000.
4. Falko Bause and Pieter S. Kritzinger. Stochastic Petri Nets. Vieweg Verlag, 2nd edition, 2002.
5. E. Brinksma and H. Hermanns. Process algebra and Markov chains. In J.-P. Katoen E. Brinksma, H. Hermanns, editor, FMPA 2000, number 2090 in LNCS, pages 183-231. Springer, 2001.
6. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3,4):241-266, 1996.
7. P.R. D'Argenio. Algebras and Automata for Timed and Stochastic Systems. IPA Dissertation Series 1999-10, CTIT PhD-Thesis Series 99-25, University of Twente, November 1999.
8. H. Ehrig, M. Pfender, and H.J. Schneider. Graph grammars: an algebraic approach. In 14th Annual IEEE Symposium on Switching and Automata Theory, pages 167-180. IEEE, 1973.
9. T. Gilb. Principles of Software Engineering Management. Addison-Wesley, 1988.
10. A. Habel, R. Heckel, and G. Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26(3,4):287 - 313, 1996.
11. R. Heckel, G. Lajios, and S. Menge. Stochastic graph transformation systems. In H. Ehrig, G. Engels, F. Parisi-Presicce, and G. Rozenberg, editors, Proc. 2nd Intl. Conference on Graph Transformation (ICGT'04), Rome, Italy, volume 3256 of LNCS, pages 210 - 225. Springer-Verlag, October 2004.
12. R. Heckel, G. Lajios, and S. Menge. Modulare Analyse Stochastischer Graphtransformationssysteme. In P. Liggesmeyer, K. Pohl, and M. Goedicke, editors, Software Engineering 2005, Essen, Germany, volume 64 of Lecture Notes in Informatics, pages 141 - 152. GI, March 2005.
13. M. Korff and L. Ribeiro. Concurrent derivations as single pushout graph grammar processes. In Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA), volume 2 of Electronic Notes in TCS, pages 113-122. Elsevier Science, 1995.
14. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In T. Field, P. Harrison, J. Bradley, and U. Harder, editors, Proc. 12th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS'02), volume 2324 of LNCS, pages 200-204. Springer, 2002.
15. M. Löwe. Algebraic approach to single-pushout graph transformation. Theoret. Comput. Sci., 109:181-224, 1993.
16. L. Mariani. Fault-tolerant routing for p2p systems with unstructured topology. In Proc. International Symposium on Applications and the Internet (SAINT 2005), Trento (Italy), 2005. IEEE Computer Society.
17. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73-155, 1992.
18. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
19. M. K. Molloy. On the Integration of Delay and Throughput Measures in Distributed Processing Models. PhD thesis, University of California, 1981.
20. S. Natkin. Les Réseaux de Petri Stochastiques et leur Application à l'Evaluation des Systèmes Informatiques. PhD thesis, CNAM Paris, 1980.
21. James R. Norris. Markov Chains. Cambridge University Press, 1997.
22. C. Priami. Stochastic π-calculus. The Computer Journal, 38:578 - 589, 1995. Proc. PAPM '95.
23. A. Rensink. The GROOVE simulator: A tool for state space generation. In J.L. Pfaltz, M. Nagl, and B. Bohlen, editors, Applications of Graph Transformation with Industrial Relevance Proc. 2nd Intl. Workshop AGTIVE'OS, Charlottesville, USA, 2003. volume 3062 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004.
24. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.
25. W. Stewart, Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
26. University of Paderborn Software Engineering Group. The Fujaba Tool Suite, www.fujaba.de.