Skip to main content

A Tool for the Performance Analysis of Concurrent Systems

  • Conference paper
  • 57 Accesses

Part of the book series: Workshops in Computing ((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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Design 2.0 Manual. Meta Software Corporation, 150 Cambridge Park Drive, Cambridge, MA 02140, 1988.

    Google Scholar 

  2. 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. 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. 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. Robin Milner. A Calculus for Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer Verlag, 1980.

    Book  Google Scholar 

  6. R. Milner. A complete inference system for a class of regular behaviors. Journal of Computer and System Science, 28:439–436, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  7. Design Open Architecture Development System Manual. Meta Software Corporation, 150 Cambridge Park Drive, Cambridge, MA 02140, 1988.

    Google Scholar 

  8. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag London

About this paper

Cite this paper

Carchiolo, V., Faro, A., Malgeri, M. (1990). A Tool for the Performance Analysis of Concurrent Systems. In: Rattray, C. (eds) Specification and Verification of Concurrent Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3534-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3534-0_6

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19581-8

  • Online ISBN: 978-1-4471-3534-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics