Skip to main content

Extended Markovian Process Algebra

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1119))

Included in the following conference series:

Abstract

EMPA enhances the expressiveness of classical process algebras by integrating functional and performance descriptions of concurrent systems. This is achieved by offering, besides passive actions (useful for pure nondeterminism), actions whose duration is exponentially distributed as well as immediate actions (useful for performance abstraction), parametrized by priority levels (hence prioritized choices) and weights (hence probabilistic choices). In order to analyze an EMPA term, from its integrated semantic model (a transition system labeled on both action types and action durations) we derive a functional semantic model (a transition system labeled on action types only) and a performance semantic model (a Markov chain). We show that an integrated analysis, i.e. a notion of equivalence on the integrated semantic model, is not only convenient but also necessary to achieve compositionality.

This research has been partially funded by MURST, CNR and LOMAPS n. 8130.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajmone Marsan, G. Balbo, G. Conte, “A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems”, in ACM Trans. on Computer Systems 2:143–172, 1984

    Google Scholar 

  2. J. Baeten, J. A. Bergstra, J. W. Klop, “Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra”, in Fundamenta Informatica IX:127–168, 1986

    Google Scholar 

  3. M. Bernardo, L. Donatiello, R. Gorrieri, “Integrating Performance and Functional Analysis of Concurrent Systems with EMPA”, Technical Report UBLCS-95-14, University of Bologna (Italy), September 1995 (revised March 1996), available via anonymous from ftp.cs.unibo.it:/pub/TR/UBLCS

    Google Scholar 

  4. P. Bftpuchholz, “Markovian Process Algebra: Composition and Equivalence”, in Proc. of PAPM '94, Erlangen (Germany), pages 11–30, July 1994

    Google Scholar 

  5. R. Cleaveland, M. Hennessy, “Priorities in Process Algebras”, in Proc. of LICS '88, Edinburgh (UK), IEEE-CS Press, pages 193–202, July 1988

    Google Scholar 

  6. D. Ferrari, “Considerations on the Insularity of Performance Evaluation”, in IEEE Trans. on Software Engineering 12(6):678–683, June 1986

    Google Scholar 

  7. R. van Glabbeek, S. A. Smolka, B. Steffen, C. M. N. Tofts, “Reactive, Generative and Stratified Models of Probabilistic Processes”, in Proc. of LICS '90, Philadelphia (PA), IEEE-CS Press, pages 130–141, 1990

    Google Scholar 

  8. N. Götz, U. Herzog, M. Rettelbach, “Multiprocessor and Distributed System Design: the Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras”, in Proc. of PERFORMANCE '93, Rome (Italy), LNCS 729:121–146, September 1993

    Google Scholar 

  9. H. Hermanns, M. Rettelbach, “Syntax, Semantics, Equivalences, and Axioms for MTIPP”, in Proc. of PAPM '94, Erlangen (Germany), pages 71–87, July 1994

    Google Scholar 

  10. J. Hillston, “A Compositional Approach to Performance Modelling”, Ph.D. Thesis, University of Edinburgh (UK), March 1994

    Google Scholar 

  11. .C. A. R. Hoare, “Communicating Sequential Processes”, Prentice Hall, 1985

    Google Scholar 

  12. J. G. Kemeny, J. L. Snell, “Finite Markov Chains”, Springer-Verlag, 1977

    Google Scholar 

  13. L. Kleinrock, “Queueing Systems”, Wiley, 1975

    Google Scholar 

  14. K. G. Larsen, A. Skou, “Bisimulation through Probabilistic Testing”, in Information and Computation 94(1):1–28, September 1991

    Google Scholar 

  15. D. Lehmann, M. Rabin, “On the Advantage of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem”, in Proc. of POPL '81, pages 133–138, 1981

    Google Scholar 

  16. R. Milner, “Communication and Concurrency”, Prentice Hall, 1989

    Google Scholar 

  17. M. F. Neuts, “Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach”, John Hopkins University Press, 1981

    Google Scholar 

  18. R. Segala, “Modeling and Verification of Randomized Distributed Real-Time Systems”, Ph.D. Thesis, MIT, June 1995

    Google Scholar 

  19. C. Tofts, “A Synchronous Calculus of Relative Frequency”, in Proc. of CON-CUR '90, Amsterdam (The Netherlands), LNCS 458:467–480, August 1990

    Google Scholar 

  20. Y. Yemini, J. Kurose, “Towards the Unification of the Functional and Performance Analysis of Protocols, or Is the Alternating-Bit Protocol Really Correct?”, in Protocol Specification, Testing and Verification II, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernardo, M., Gorrieri, R. (1996). Extended Markovian Process Algebra. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics