Skip to main content
SpringerLink
Log in

Process Algebra and Markov Chains

  • Chapter
  • First Online:
Lectures on Formal Methods and PerformanceAnalysis (EEF School 2000)

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

Included in the following conference series:

Abstract

This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides basic introductions to both fields, where we also study the Markov chains from an algebraic perspective, viz. that of Markov chain algebra. We then proceed to study the interrelation of reactive processes and Markov chains in this setting, and introduce the algebra of Interactive Markov Chains as an orthogonal extension of both process and Markov chain algebra. We conclude with comparing this approach to related (Markovian) stochastic process algebras by analysing the algebraic principles that they support.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jos Baeten and Peter Weijland. Process Algebra, volume 18 of Cambridge Tracts in Computer Science. Cambridge University Press, 1990.

    Google Scholar 

  2. G. Balbo. Introduction to Stochastic Petri Nets. This volume.

    Google Scholar 

  3. J.A. Bergstra, A. Ponse, and S.A. Smolka, editors. Handbook of Process Algebra. Elsevier Science Publishers, 2001.

    Google Scholar 

  4. M. Bernardo and R. Gorrieri. Extended Markovian Process Algebra. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR’ 96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), volume 1119 of Lecture Notes in Computer Science. Springer, 1996.

    Google Scholar 

  5. T. Bolognesi and E. Brinksma. Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems, 14, 1987.

    Google Scholar 

  6. M. Bravetti and M. Bernardo. Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In Proc. of the 1st International Workshop on Models for Time Critical Systems, volume 39(3) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2000.

    Google Scholar 

  7. M. Bravetti and R. Gorrieri. A complete axiomatisation for observational congruence of prioritized finite state behaviours. In U. Montanari, J.D.P. Rolim, and E. Welzl, editors, Automata, Languages, and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 744–755, Geneva, Switzerland, 2000. Springer.

    Chapter  Google Scholar 

  8. E. Brinksma, J.-P. Katoen, R. Langerak, and D. Latella. A stochastic causalitybased process algebra. In S. Gilmore and J. Hillston, editors, Proc. of the 3rd Workshop on Process Algebras and Performance Modelling. Special Issue of “The Computer Journal”, 38(7) 1995.

    Google Scholar 

  9. E. Brinksma, A. Rensink, and W. Vogler. Fair Testing. In Insup Lee and Scott Smolka, editors, Proceedings of 6th International Conference on Concurrency Theory (CONCUR’ 95, Philadelphia), volume 962 of Lecture Notes in Computer Science. Springer, 1995.

    Google Scholar 

  10. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A Theory of Communicating Sequential Processes. Journal of the ACM, 31(3):560–599, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Buchholz. Markovian Process Algebra: Composition and Equivalence. In U. Herzog and M. Rettelbach, editors, Proc. of the 2nd Workshop on Process Algebras and Performance Modelling, Regensberg/Erlangen, July 1994. Arbeitsberichte des IMMD, Universität Erlangen-Nürnberg.

    Google Scholar 

  12. R. Cleaveland, G. Lüttgen, and M. Mendler. An algebraic theory of multiple clock. In A. Mazurkievicz and J. Winkowski, editors, CONCUR’ 97: Concurrency Theory (8th International Conference, Warszaw, Poland, August 1997), volume 1243 of Lecture Notes in Computer Science, pages 166–180. Springer, 1996.

    Google Scholar 

  13. P.R. D’Argenio and C. Verhoef. A conservative extension theorem in process algebras with inequalities. Theoretical Computer Science, 177:351–380, 1997.

    Article  MathSciNet  Google Scholar 

  14. P. Darondeau. An Enlarged Definition and Complete Axiomatisation of Observational Congruence of Finite Processes. In M. Dezani-Ciancaglini and U. Montanari, editors, International Symposium on Programming, volume 137 of Lecture Notes in Computer Science, pages 47–61._Springer, 1982.

    Google Scholar 

  15. S. Donatelli. Superposed Generalised Stochastic Petri Nets: Definition and Efficient Solution. In M. Silva, editor, Proc. of 15th Int. Conference on Application and Theory of Petri Nets, volume 815 of Lecture Notes in Computer Science, pages 258–277._Springer, 1994.

    Google Scholar 

  16. N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis using Stochastic Process Algebras. In Performance’93, 1993.

    Google Scholar 

  17. J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263–299, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. B. Haverkort. Markovian Models for Performance and Dependability Evaluation. This volume.

    Google Scholar 

  19. H. Hermanns. Interactive Markov Chains. PhD thesis, Universität Erlangen-Nürnberg, September 1998. Arbeitsberichte des IMMD 32/7.

    Google Scholar 

  20. H. Hermanns, U. Herzog, and J.-P. Katoen. Process algebra for performance evaluation. Theoretical Computer Science, 2001. to appear.

    Google Scholar 

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

    Article  Google Scholar 

  22. H. Hermanns and J.-P. Katoen. Automated compositional markov chain generation for a plain-old telephone system. Science of Computer Programming, 36(1):97–127, 2000.

    Article  MATH  Google Scholar 

  23. H. Hermanns and M. Rettelbach. Syntax, Semantics, Equivalences, and Axioms for MTIPP. In U. Herzog and M. Rettelbach, editors, Proc. of the 2nd Workshop on Process Algebras and Performance Modelling, Erlangen-Regensberg, July 1994. IMMD, Universität Erlangen-Nürnberg.

    Google Scholar 

  24. H. Hermanns and M. Siegle. Bisimulation Algorithms for Stochastic Process Algebras and their BDD-based Implementation. In J.-P. Katoen, editor, ARTS’99, 5th Int. AMAST Workshop on Real-Time and Probabilistic Systems, pages 144–264. Springer, LNCS 1601, 1999.

    Google Scholar 

  25. U. Herzog. Formal methods for performance evaluation. This volume.

    Google Scholar 

  26. J. Hillston. Exploiting structure in solution: Decomposing compositional models. This volume.

    Google Scholar 

  27. J. Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994.

    Google Scholar 

  28. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ, 1985.

    MATH  Google Scholar 

  29. K. Honda and M. Tokoro. On Asynchronous Communication Semantics. In M. Tokoro, O. Nierstrasz, and P. Wegner, editors, Object-Based Concurrent Computing 1991, volume 612 of Lecture Notes in Computer Science, pages 21–51. Springer, 1992.

    Google Scholar 

  30. ISO. LOTOS: A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, 1989.

    Google Scholar 

  31. B. Jacobs and J. Rutten. A Tutorial on (Co)Algebras and (Co)Induction. EATCS Bulletin, 62:222–259, June 1997.

    MATH  Google Scholar 

  32. J.-P. Katoen. Quantitative and Qualitative Extensions of Event Structures. PhD thesis, Centre for Telematics and Information Technology, Enschede, 1996.

    Google Scholar 

  33. J.-P. Katoen and P.R. D’Argenio. General distributions in process algebra. This volume.

    Google Scholar 

  34. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Springer, 1976.

    Google Scholar 

  35. R. Langerak. A testing theory for lotos using deadlock detection. In E. Brinksma, G. Scollo, and C.A. Vissers, editors, Protocol Specification Testing and Verification IX, pages 87–98. North-Holland, 1989.

    Google Scholar 

  36. R. Langerak. Transformations and Semantics for LOTOS. PhD thesis, University of Twente, 1992.

    Google Scholar 

  37. R. Milner. Calculi for Synchrony and Asynchrony. Theoretical Computer Science, 25:269–310, 1983.

    Article  MathSciNet  Google Scholar 

  38. R. Milner. A Complete Inference System for a Class of Regular Behaviours. Journal of Computer and System Science, 28:439–466, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  39. R. Milner. Process constructors and interpretations. In Proc. IFIP-WG Information Processing. North-Holland, 1986.

    Google Scholar 

  40. R. Milner. Communication and Concurrency. Prentice Hall, London, 1989.

    MATH  Google Scholar 

  41. U. Montanari and V. Sassone. Dynamic Congruence vs. Progressing Bisimulation for CCS. Fundamenta Informaticae, XVI(2):171–199, 1992.

    MathSciNet  Google Scholar 

  42. V. Natarjan and R. Cleaveland. Divergence and Fair Testing. In ICALP 95, volume 944 of Lecture Notes in Computer Science, pages 648–659. Springer, 1995.

    Google Scholar 

  43. M.F. Neuts. Matrix-geometric Solutions in Stochastic Models-An Algorithmic Approach. The Johns Hopkins University Press, 1981.

    Google Scholar 

  44. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  45. X. Nicollin and J. Sifakis. An Overview and Synthesis on Timed Process Algebras. In J.W. de Bakker, K. Huizing, and W.-P. de Roever, editors, Real-Time: Theory in Practice (REX Workshop), volume 600 of Lecture Notes in Computer Science. Springer, 1990.

    Google Scholar 

  46. E.-R. Olderog and C.A.R. Hoare. Specification Oriented Semantics for Communicating Processes. Acta Informatica, 23:9–66, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  47. D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Fifth GI Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer, 1981.

    Google Scholar 

  48. Joachim Parrow and Peter Sjödin. The Complete Axiomatization of cs-Congruence. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, STACS’ 94, volume 775 of Lecture Notes in Computer Science, pages 557–568. Springer, 1994.

    Google Scholar 

  49. I. Phillips. Refusal testing. Theoretical Computer Science, 50(2):241–284, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  50. B. Plateau and K. Atif. Stochastic Automata Network for Modeling Parallel Systems. IEEE Transactions on Software Engineering, 17(10), 1991.

    Google Scholar 

  51. G.D. Plotkin. A Structured Approach to Operational Semantics. Technical Report DAIMI FM-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  52. M. Hennessy und T. Regan. A process algebra for timed systems. Information and Computation, 117:221–239, 1995.

    Article  MathSciNet  Google Scholar 

  53. A. Valmari and M. Tienari. Compositional Failure-based Semantic Models for Basic LOTOS. Formal Aspects of Computing, 7:440–468, 1995.

    Article  MATH  Google Scholar 

  54. R.J. van Glabbeek and W. Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM, 43(3):555–600, 1996.

    Article  MathSciNet  Google Scholar 

  55. R.J. van Glabbeek. The Linear Time-Branching Time Spectrum II: The Semantics of Sequential Systems With Silent Moves (Extended Abstract). In Eike Best, editor, Fourth International Conference on Concurrency Theory (CONCUR’ 93, Hildesheim, Germany), volume 715 of Lecture Notes in Computer Science, pages 66–81. Springer, 1993.

    Google Scholar 

  56. R.J. van Glabbeek. The Linear Time-Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes. In Bergstra et al. [3], pages 3–99.

    Google Scholar 

  57. R.J. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121:59–80, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  58. C.A. Vissers, G. Scollo, M. van Sinderen, and E. Brinksma. Specification Styles in Distributed Systems Design and Verification. Theoretical Computer Science, 89(1):179–206, 1991.

    Article  MATH  Google Scholar 

  59. W. Yi. CCS + Time = An Interleaving Model for Real Time Systems. In J. Leach Albert, B. Monien, and M. Rodríguez, editors, Eighteenth Colloquium on Automata, Languages and Programming (ICALP) (Madrid, Spain), volume 510 of Lecture Notes in Computer Science, pages 217–228. Springer, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Formal Methods and Tools Group, Faculty of Computer Science, University of Twente, 217, 7500, AE, Enschede, The Netherlands

    Holger Hermanns

Authors
  1. Ed Brinksma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Holger Hermanns
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Formal Methods and Tools Group, University of Twente, 217, 7500, AE, Enschede, The Netherlands

    Ed Brinksma , Holger Hermanns  & Joost-Pieter Katoen ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brinksma, E., Hermanns, H. (2001). Process Algebra and Markov Chains. In: Brinksma, E., Hermanns, H., Katoen, JP. (eds) Lectures on Formal Methods and PerformanceAnalysis. EEF School 2000. Lecture Notes in Computer Science, vol 2090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44667-2_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44667-2_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42479-6

  • Online ISBN: 978-3-540-44667-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation