Skip to main content
SpringerLink
Log in

Deriving Symbolic Representations from Stochastic Process Algebras

  • Conference paper
  • First Online:
Book cover Process Algebra and Probabilistic Methods: Performance Modeling and Verification (PAPM-PROBMIV 2002)

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

Abstract

A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multi-terminal binary decision diagrams. It is shown that the new semantics is Markovian bisimulation equivalent to the standard SOS semantics. The paper also addresses the difficult question of keeping the underlying state space minimal at every construction step.

This work is supported by the DFG-funded project BDDANA (HE 1408/8) and by the DFG/NWO-funded project VOSS (SI 710/2).

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. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications. Formal Methods in System Design, 10(2/3):171–206, April/May 1997.

    Google Scholar 

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

  3. H. Bohnenkamp. Kompositionelle Semantiken stochastischer Prozeßalgebren zur Erzeugung reduzierter Transitionssysteme. Master’s thesis, University of Erlangen-Nürnberg, Informatik 7, 1995 (in German).

    Google Scholar 

  4. A. Bouali and R. de Simone. Symbolic Bisimulation Minimisation. In Computer Aided Verification, pages 96–108, 1992. LNCS 663.

    Google Scholar 

  5. R.E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.

    Google Scholar 

  6. P. Buchholz. Exact and Ordinary Lumpability in Finite Markov Chains. Journal of Applied Probability, (31):59–75, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic Model Checking for Probabilistic Processes using MTBDDs and the Kronecker Representation. In S. Graf and M. Schwartzbach, editors, TACAS 2000, LNCS 1785, pages 395–410, Berlin, 2000.

    Google Scholar 

  8. A. Dsouza and B. Bloom. Generating BDD models for process algebra terms. In Computer Aided Verification, pages 16–30, 1995. LNCS 939.

    Google Scholar 

  9. R. Enders, T. Filkorn, and D. Taubner. Generating BDDs for symbolic model checking in CCS. Distributed Computing, (6):155–164, 1993.

    Article  MATH  Google Scholar 

  10. J.C. Fernandez. An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming, 13:219–236, 1989.

    Article  Google Scholar 

  11. M. Fujita, P. McGeer, and J.C.-Y. Yang. Multi-terminal Binary Decision Diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10(2/3):149–169, April/May 1997.

    Google Scholar 

  12. N. Götz. Stochastische Prozeßalgebren-Integration von funktionalem Entwurf und Leistungsbewertung Verteilter Systeme. Ph.D. thesis, Universität Erlangen-Nürnberg, 1994 (in German).

    Google Scholar 

  13. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras — Between LOTOS and Markov Chains. Computer Networks and ISDN (CNIS), 30(9-10):901–924, 1998.

    Article  Google Scholar 

  14. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In B. Plateau, W.J. Stewart, and M. Silva, editors, 3rd Int. Workshop on the Numerical Solution of Markov Chains, pages 188–207. Prensas Universitarias de Zaragoza, 1999.

    Google Scholar 

  15. H. Hermanns and M. Rettelbach. Syntax, Semantics, Equivalences, and Axioms for MTIPP. In Proc. of PAPM’94, pages 71–88. Arbeitsberichte des IMMD 27 (4), Universität Erlangen-Nürnberg, 1994.

    Google Scholar 

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

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

    Google Scholar 

  18. P. Kanellakis and S. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, 86:43–68, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  19. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and Symbolic CTMC Model Checking. In PAPM-PROBMIV 2001, pages 23–38. Springer, LNCS 2165, 2001.

    Google Scholar 

  20. M. Kuntz and M. Siegle. Deriving symbolic representations from stochastic process algebras. Tech. Rep. Informatik 7 03/02, Universität Erlangen-Nürnberg, 2002.

    Google Scholar 

  21. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic Symbolic Model Checker. In P. Kemper, editor, MMB-PNPM-PAPM-PROBMIV Tool Proceedings, pages 7–12. Univ. Dortmund, Informatik IV, Bericht 760/2001, 2001.

    Google Scholar 

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

    MATH  Google Scholar 

  23. R. Paige and R. Tarjan. Three Partition Refinement Algorithms. SIAM Journal of Computing, 16(6):973–989, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  24. M. Rettelbach and M. Siegle. Compositional Minimal Semantics for the Stochastic Process Algebra TIPP. In Proc. of PAPM’94, pages 89–106. Arbeitsberichte des IMMD 27 (4), Universität Erlangen-Nürnberg, 1994.

    Google Scholar 

  25. M. Siegle. Compact representation of large performability models based on extended BDDs. In Fourth Int. Workshop on Performability Modeling of Computer and Communication Systems (PMCCS4), pages 77–80, Williamsburg, Sept. 1998.

    Google Scholar 

  26. M. Siegle. Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs. In D. Baum, N. Müller, and R. Rödler, editors, MMB’99, pages 173–185, Trier, September 1999. VDE Verlag.

    Google Scholar 

  27. M. Siegle. Advances in model representation. In L. de Alfaro and S. Gilmore, editors, Process Algebra and Probabilistic Methods, Joint Int. Workshop PAPM-PROBMIV 2001, pages 1–22. Springer, LNCS 2165, September 2001.

    Google Scholar 

  28. R. Sisto. A method to build symbolic representations of LOTOS specifications. In Protocol Specification, Testing and Verification, pages 323–338, 1995.

    Google Scholar 

  29. A. Xie and P.A. Beerel. Implicit Enumeration of Strongly Connected Components. In ICCAD’99, pages 37–40. IEEE, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany

    Matthias Kuntz & Markus Siegle

Authors
  1. Matthias Kuntz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Siegle
    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, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Holger Hermanns

  2. Department of Computer Science, University of Verona, Strada Le Grazie 15, 37134, Verona, Italy

    Roberto Segala

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuntz, M., Siegle, M. (2002). Deriving Symbolic Representations from Stochastic Process Algebras. In: Hermanns, H., Segala, R. (eds) Process Algebra and Probabilistic Methods: Performance Modeling and Verification. PAPM-PROBMIV 2002. Lecture Notes in Computer Science, vol 2399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45605-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45605-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43913-4

  • Online ISBN: 978-3-540-45605-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation