Compositional performance modelling with the tipptool

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

Volumn 1469, Issue , 1998, Pages 51-62

  Hermanns, H ^a   Herzog, U ^a   Klehmet, U ^a   Mertsiotakis, V ^a   Siegle, M ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

BENEFICIAL ASPECTS; COMPOSITIONAL SPECIFICATIONS; FRONT END; ON STATE; PERFORMANCE MODEL; PERFORMANCE MODELLING; STOCHASTIC PROCESS ALGEBRAS; USER FRIENDLY;

SPECIFICATIONS;

EID: 84958062536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68061-6_5     Document Type: Conference Paper

References (30)

1. Workshops on Process Algebras and Performance Modelling, 1993 Edinburgh, 1994 Erlangen, 1995 Edinburgh, 1996 Torino, 1997 Twente, 1998 Nice.
2. M. Ajmone Marsan, G. Balbo, and G. Conte. Performance Models of Multiprocessor Systems. MIT Press, 1986.
3. C. Baier. Polynomial time algorithms for testing probabilistic bisimulation and simulation. In Proc. CAV’96. LNCS 1102,1996.
4. M. Bernardo and R. Gorrieri. Extended Markovian Process Algebra. In CONCUR '96.
5. T. Bolognesi and E. Brinksma. Introduction to thelSO specificationlanguageLOTOS. Computer Networks and ISDN Systems, 14:25-59,1987.
6. M. Bozga, J.-C. Fernandez, A. Kerbrat, and L. Mounier. Protocol verification with the Alde-BARAN toolset. Int. J. Softw. Tools for Techn. Transf, 1(1/2): 166-184,1997.
7. G. Chehaibar, H. Garavel, L. Mounier, N. Tawbi, and F. Zulian. Specification and Verification of the Powerscale Bus Arbitration Protocol: An Industrial Experiment with LOTOS. In Formal Description Techniques IX. Chapmann Hall, 1996.
8. PR. D’Argenio, J-P. Katoen, and E. Brinksma. An algebraic approach to the specification of stochastic systems. In Programming Concepts and Methods. Chapman and Hall, 1998.
9. S. Gilmore and J. Hillston. The PEPA Workbench: A Tool to Support a Process Algebra-Based Approach to Performance Modelling. In 7th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Wien, 1994.
10. N. Gotz. Stochastische ProzeBalgebren - Integration von funktionalem Entwurf und Leis- tungsbewertung Verteilter Systeme. PhD thesis, Universitat Erlangen-Nurnberg, April 1994.
11. N. Gotz, U. Herzog, and M. Rettelbach. Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras. In Tutorial Proc. of PERFORMANCE’93. LNCS 729.
12. F. Hartleb and A. Quick. Performance Evaluation of Parallel Programms — Modeling and Monitoring with the Tool PEPP. In Proc."Messlma,Modollierung und Bewertung von Rechen- und Kommunikationssystemen", p. 51-63. Informatik Aktuell, Springer, 1993.
13. H. Hermanns. Interactive Markov Chains. PhD thesis, Universitat Erlangen-Nurnberg, 1998.
14. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras as a Tool for Performance and Dependability Modelling. In Proc. of IEEE Int. Computer Performance and Dependability Symposium, p. 102-111, 1995. IEEE Computer Society Press.
15. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras - Between LOTOS and Markov Chains. Computer Networks and ISDN Systems, 30(9-10):901-924,1998.
16. H. Hermanns, M. Rettelbach, and T. Weib. Formal characterisation of immediate actions in SPA with nondeterministic branching. In The Computer Journal [1], 1995.
17. U. Herzog. Formal Description, Time and Performance Analysis. A Framework. In Entwurf undBetrieb Verteilter Systeme. Springer, Berlin, IFB 264,1990.
18. U. Herzog. A Concept for Graph-Based Stochastic Process Algebras, Generally Distributed Activity Times and Hierarchical Modelling. [1], 1996.
19. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
20. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
21. P. Kanellakis and S. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, 86:43-68,1990.
22. J.P. Katoen, D. Latella, R. Langerak, and E. Brinksma. Partial Order Models for Quantitative Extensions of LOTOS. Computer Networks and ISDN Systems, 1998. to appear.
23. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Springer, 1976.
24. J.A. Manas, T. de Miguel, and J. Salvachua. Tool Support to Implement LOTOS Specifications. Computer Networks and ISDN Systems, 25(7), 1993.
25. V. Mertsiotakis. Approximate Analysis Methods for Stochastic Process Algebras. PhD thesis, Universitat Erlangen-Nurnberg, 1998. to appear.
26. R. Milner. Communication and Concurrency. Prentice Hall, London, 1989.
27. R. Paige and R. Tarjan. Three Partition Refinement Algorithms. SIAM Journal of Computing, 16(6):973-989,1987.
28. C. Priami. Stochastic 7r-calculus. [1], 1995.
29. M. Rettelbach. Stochastische ProzeBalgebren mit zeitlosen Aktivitaten und probabilistischen Verzweigungen PhD thesis, Universitat Erlangen-Nurnberg, 1996.
30. M. Siegle. Technique and tool for symbolic representation and manipulation of stochastic transition systems. TRIMMD 7 2/98, Universitat Erlangen-Nurnberg, 1998.