Skip to main content
SpringerLink
Log in

Metrics for Labeled Markov Systems

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

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

Included in the following conference series:

Abstract

Partial Labeled Markov Chains (plMc) generalize process algebra and traditional Markov chains. They provide a foundation for interacting discrete probabilistic systems. Existing notions of process equivalence are too sensitive to the exact probabilities of transitions in plMcs. This paper studies more robust notions of “approximate” equivalence between plMcs.

Caelum Research Corporation

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Alur, L. J. Jagadeesan, J. J. Kott, and J. E. von Olnhausen. Model-checking of realtime systems: A telecommunications application. In Proceedings of the 19th International conference on Software Engineering, pages 514–524, 1997.

    Google Scholar 

  2. J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka. Axiomatizing probabilistic processes: Acp with generative probabilities. Information and Computation, 121(2):234–255, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. C. Baier, E. Clark, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proceedings of the 24th International Colloquium On Automata Languages And Programming, Springer Verlag LNCS vol 1256, pages 430–440, 1997.

    Google Scholar 

  4. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Proceedings of the 15th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Verlag LNCS vol 1026, pages 499–513, 1995.

    Google Scholar 

  5. R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the Twelfth IEEE Symposium On Logic In Computer Science, Warsaw, Poland., 1997.

    Google Scholar 

  6. J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Uppaal: A tool suite for automatic verification of real-time systems. In R. Alur, T. Henzinger, and E. Sontag, editors, Hybrid Systems III, Springer Verlag LNCS vol 1066, pages 232–243, 1996.

    Chapter  Google Scholar 

  7. N. Bourbaki. Elements of Mathematics: General Topology Chapters 1-4. Springer-Verlag, 1989.

    Google Scholar 

  8. F. van Breugel. private communication.

    Google Scholar 

  9. R. Cleaveland, S. A. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. Lecture Notes in Computer Science 623, 1992.

    Google Scholar 

  10. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857–907, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Desharnais, A. Edalat, and P. Panangaden. A logical characterization of bisimulation for labeled Markov processes. In Proceedings of the 13th IEEE Symposium On Logic In Computer Science, Indianapolis. IEEE Press, June 1998.

    Google Scholar 

  12. D. Dill. Trace Theory for Automatic HierarchicalVerification of Speed-IndependentCircuits. ACM Distinguished Dissertations. MIT Press, 1988.

    Google Scholar 

  13. Johan de Kleer and B. C. Williams. Diagnosis with behavioral modes. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 1324–1330, August 1989.

    Google Scholar 

  14. V. Gupta, T. A. Henzinger, and R. Jagadeesan. Robust timed automata. In Oded Maler, editor, Hybrid and Real-Time Systems, LNCS Vol 1201, pages 331–345. Springer Verlag, March 1997.

    Chapter  Google Scholar 

  15. Jane Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994. To be published as a Distinguished Dissertation by Cambridge University Press.

    Google Scholar 

  16. H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pages 278–287. IEEE Computer Society Press, 1990.

    Google Scholar 

  17. M. Huth and M. Kwiatkowska. Quantitative analysis and model checking. In Proceedings of the 12 IEEE Symposium On Logic In Computer Science, pages 111–122. IEEE Press, 1997.

    Google Scholar 

  18. S. Hart and M. Sharir. Probabilistic propositional temporal logics. Information and Control, 70:97–155, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Hutchinson. Fractals and self-similarity. Indiana University Journal of Mathematics, 30:713–747, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  20. M. B. Josephs. Receptive process theory. Acta Informatica, 29(1):17–31, February 1992.

    Article  MATH  MathSciNet  Google Scholar 

  21. C. Jones and G. D. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 186–195, Asilomar Conference Center, Pacific Grove, California, 1989.

    Chapter  Google Scholar 

  22. C. Jou and S. Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes. In CONCUR 90, Springer Verlag LNCS vol 458, 1990.

    Google Scholar 

  23. B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 431–441, San Diego, California, 1995.

    Google Scholar 

  24. D. Kozen. A probabilistic PDL. Journal of Computer and Systems Sciences, 30(2):162–178, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  25. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Computer and Communication Security (CCS-5), 1998.

    Google Scholar 

  26. Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, September 1991.

    Article  MATH  MathSciNet  Google Scholar 

  27. N. A. Lynch and M. R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219–246, 1989.

    MATH  MathSciNet  Google Scholar 

  28. M. Ajmone Marsan. Stochastic petri nets: an elementary introduction. In Advances in Petri Nets 1989, pages 1–29. Springer, June 1989.

    Google Scholar 

  29. J. L. Peterson and A. Silberschatz. Operating System Concepts. Addison-Wesley Inc., 1985.

    Google Scholar 

  30. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995. Also appears as technical Report MIT/LCS/TR-676.

    Google Scholar 

  31. F. W. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 387–398, Amsterdam, The Netherlands, 15-18 July 1991. IEEE Computer Society Press.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  33. N. Viswanadham and Y. Narahari. Performance Modeling of Automated Manufacturing Systems. Prentice-Hall Inc., 1992.

    Google Scholar 

  34. S.-H. Wu, S. A. Smolka, and E. Stark. Composition and behaviors for probabilistic i/o automata. Theoretical Computer Science, 176(1-2):1–36, April 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, Montreal, Quebec, Canada

    Josée Desharnais & Prakash Panangaden

  2. Autonomy and Robotics Area, NASA Ames Research Center, Moffett Field, CA, 94035, USA

    Vineet Gupta

  3. Dept. of Math. and Computer Sciences, Loyola University-Lake Shore Campus, Chicago, IL, 60626, USA

    Radha Jagadeesan

Authors
  1. Josée Desharnais
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vineet Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prakash Panangaden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P. (1999). Metrics for Labeled Markov Systems. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation