Skip to main content
SpringerLink
Log in

Stochastic Process Algebras Meet Eden

  • Conference paper
  • First Online:
Integrated Formal Methods (IFM 2002)

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

Included in the following conference series:

Abstract

Process algebras represent an appropriate mechanism to formally specify concurrent systems. In order to get a thorough knowledge of these systems, some external formalism must be used. In this paper we propose an integrated framework where a (non-trivial) process algebra is combined with a (concurrent) functional language. Specifically, we consider a stochastic process algebra featuring value passing where distributions are not restricted to be exponential. In order to study properties of these specifications, we translate them into functional programs written in Eden. This functional language is very suitable for concurrent programming. On the one hand, it presents the usual features of modern functional languages. On the other hand, it allows the execution of concurrent processes. We present an example showing how specifications can be translated into Eden and how quantitative properties can be studied.

Research supported in part by the CICYT projects TIC2000-0701-C02-01 and TIC2000-0738, and the Spanish-British Acción Integrada HB 1999-0102.

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. J.C.M. Baeten and C.A. Middelburg. Process algebra with timing: Real time and discrete time. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of process algebra, chapter 10. North Holland, 2001.

    Google Scholar 

  2. J.A. Bergstra, A. Ponse, and S.A. Smolka, editors. Handbook of Process Algebra. North Holland, 2001.

    Google Scholar 

  3. M. Bernardo. Theory and application of extended markovian process algebra. PhD thesis, Università di Bologna, 1999.

    Google Scholar 

  4. M. Bernardo and R. Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1–54, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Bravetti and R. Gorrieri. The theory of interactive generalized semi-markov processes. To appear in Theoretical Computer Science., 2001.

    Google Scholar 

  6. S. Breitinger, U. Klusik, R. Loogen, Y. Ortega, and R. Peña. DREAM: the distributed Eden abstract machine. In Implementation of Functional Languages. LNCS 1467., pages 250–269. Springer, 1998.

    Chapter  Google Scholar 

  7. S. Breitinger, R. Loogen, Y. Ortega, and R. Peña. Eden: Language definition and operational semantics. Technical Report, Bericht 96-10, Philipps-Universität Marburg, Germany, 1998.

    Google Scholar 

  8. J. Bryans, J. Davies, and S. Schneider. Towards a denotational semantics for ET-LOTOS. In CONCUR’95, LNCS 962, pages 269–283, 1995.

    Google Scholar 

  9. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.

    Google Scholar 

  10. R. Cleaveland, Z. Dayar, S.A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93–148, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  11. P.R. D’Argenio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Department of Computer Science. University of Twente, 1999.

    Google Scholar 

  12. J. Davies and S. Schneider. A brief history of timed CSP. Theoretical Computer Science, 138:243–271, 1995.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 16th Int. Symp. on Computer Performance Modelling, Measurement and Evaluation (PERFORMANCE’93), LNCS 729, pages 121–146. Springer, 1993.

    Google Scholar 

  15. C. Gregorio and M. Núñez. Specifying and verifying the Alternating Bit Protocol with Probabilistic-Timed LOTOS. In COST 247 International Workshop on Applied Formal Methods in System Design, pages 38–50, 1996.

    Google Scholar 

  16. Jan Friso Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263–299, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  17. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Systems. Uppsala University, 1991.

    Google Scholar 

  18. H. Hermanns, J-P. Katoen, J. Meyer-Kayser, and M. Siegle. Towards model checking stochastic process algebra. In IFM 2000, LNCS 1945, pages 420–440. Springer, 2000.

    Google Scholar 

  19. F. Hernández, R. Peña, and F. Rubio. From GranSim to Paradise. In Trends in Functional Programming, pages 11–19. Intellect, 2000.

    Google Scholar 

  20. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.

    Google Scholar 

  21. IEEE. 802.5: Token ring access method. IEEE, 1985.

    Google Scholar 

  22. G.G. Infante López, H. Hermanns, and J.-P. Katoen. Beyond memoryless distributions: Model checking semi-Markov chains. In PAPM-PROBMIV 2001, LNCS 2165, pages 57–70. Springer, 2001.

    Google Scholar 

  23. B. Jonsson, W. Yi, and K.G. Larsen. Probabilistic extensions of process algebras. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of process algebra, chapter 11. North Holland, 2001.

    Google Scholar 

  24. U. Klusik, R. Loogen, S. Priebe, and F. Rubio. Implementation skeletons in Eden: Low-effort parallel programming. In Implementation of Functional Languages, IFL’00, LNCS 2011. Springer, 2001.

    Chapter  Google Scholar 

  25. H.W. Loidl. GranSim User’s Guide. Department of Computing Science, Glasgow University, 1996.

    Google Scholar 

  26. N. López and M. Núñez. A testing theory for generally distributed stochastic processes. In CONCUR 2001, LNCS 2154, pages 321–335. Springer, 2001.

    Chapter  Google Scholar 

  27. N. López, M. Núñez, and F. Rubio. Implementation relation between VPSPA and Eden, 2002. http://dalila.sip.ucm.es/~natalia/ifm02/appendix.ps.

  28. G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315–352, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  29. J.A. Mañas and T. de Miguel. From LOTOS to C. In International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols, pages 79–84. Elsevier, 1988.

    Google Scholar 

  30. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Computer Aided Verification’91, LNCS 8575, pages 376–398, 1991.

    Google Scholar 

  31. M. Núñez, D. de Frutos, and L. Llana. Acceptance trees for probabilistic processes. In CONCUR’95, LNCS 962, pages 249–263. Springer, 1995.

    Google Scholar 

  32. R. Peña and F. Rubio. Parallel Functional Programming at Two Levels of Abstraction. In Principles and Practice of Declarative Programming (PPDP01), pages 187–198. ACM Press, 2001.

    Google Scholar 

  33. S.L. Peyton Jones, A. Gordon, and S. Finne. Concurrent Haskell. In ACM Symp. on Principles of Prog. Lang. POPL’96, pages 295–308. ACM Press, 1996.

    Google Scholar 

  34. S.L. Peyton Jones and J. Hughes, editors. Report on the Programming Language Haskell 98. Available at http://www.haskell.org, 1999.

Download references

Author information

Authors and Affiliations

  1. Dept. Sistemas Informáticos y Programación, Universidad Complutense de Madrid, E-28040, Madrid, Spain

    Natalia López, Manuel Núñez & Fernando Rubio

Authors
  1. Natalia López
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Núñez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronics and Computer Science Declarative Systems and Software Engineering, University of Southampton, Highfield, Southampton, SO17 1BJ, UK

    Michael Butler

  2. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Luigia Petre

  3. Department of Computer Science, Åbo Akademi University, Lemminkäisenkatu 14, 20520, Turku, Finland

    Kaisa Sere

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

López, N., Núñez, M., Rubio, F. (2002). Stochastic Process Algebras Meet Eden. In: Butler, M., Petre, L., Sere, K. (eds) Integrated Formal Methods. IFM 2002. Lecture Notes in Computer Science, vol 2335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47884-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-47884-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43703-1

  • Online ISBN: 978-3-540-47884-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation