Advertisement

A Tool for the Performance Analysis of Concurrent Systems

  • Vincenza Carchiolo
  • Albert Faro
  • Michele Malgeri
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

Formal Description Techniques have been successfully experimented with for specifying and verifying concurrent systems. Generally, Formal Description Techniques are not able to specify time and probability, and are unsuitable for proving that a given system works according to desired performance requirements. For these reasons, this paper presents a language, named ELLIPSe, based on SCCS proposed by Milner providing the designer with a formal framework for reasoning about time and probability of parallel systems. An automated tool is also presented to perform the performance analysis of real systems.

Keywords

Analyzer Module Control Module Performance Index Inference Rule Prob Ability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [des88]
    Design 2.0 Manual. Meta Software Corporation, 150 Cambridge Park Drive, Cambridge, MA 02140, 1988.Google Scholar
  2. [GS88]
    A. Giacalone and S. A. Smolka. Intregrated environments for formally based design and simulation of concurrent systems. Special Issue on Integrated Software Engineering Environments, IEEE Transactions on Software Engineering, 1988.Google Scholar
  3. [KS83]
    P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. In Proceedings of the 2nd ACM Symposium on Principles ofDistributed Computing, Montreal, Canada, pages 228–240, August 1983. Revised version to appear in Information and Computation.Google Scholar
  4. [KS88]
    P. C. Kane Hakis and S. A. Smolka. On the analysis of cooperation and antagonism in networks of communicating processes. Algorithmica, 1988.Google Scholar
  5. [Mil80]
    Robin Milner. A Calculus for Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer Verlag, 1980.CrossRefGoogle Scholar
  6. [Mi184]
    R. Milner. A complete inference system for a class of regular behaviors. Journal of Computer and System Science, 28:439–436, 1984.MathSciNetMATHCrossRefGoogle Scholar
  7. [OA88]
    Design Open Architecture Development System Manual. Meta Software Corporation, 150 Cambridge Park Drive, Cambridge, MA 02140, 1988.Google Scholar
  8. [Par85]
    J. Parrow. Fairness properties in process algebra with applications in communication protocol verification. Ph.D. Thesis DoCS 85/03, Department of Computer Science, Department of Computer Science, Uppsala University, Uppsala, Sweden, 1985.Google Scholar

Copyright information

© Springer-Verlag London 1990

Authors and Affiliations

  • Vincenza Carchiolo
    • 1
  • Albert Faro
    • 1
  • Michele Malgeri
    • 1
  1. 1.Instituto di Informatica e TelecomunicazioniFacoltà di Ingegneria - Università di CataniaCataniaItaly

Personalised recommendations