Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8464))

  • 936 Accesses

Abstract

One can often extract valuable properties of Markov chains (MCs) by “compressing” them using various notions of bisimulation (exact or approximate, strong or weak, etc) [10,3,2,4]. Typically a bisimulation will lead from a concrete and perhaps overly detailed system to a simpler and more abstract one [7]. In this paper, we will go the opposite way! We will show that for the subclass of continuous-time MCs (ctMCs) corresponding to thermodynamically consistent stochastic mass action Petri nets (the standard model for chemical reactions for fast diffusing chemicals), one can construct in a systematic fashion concrete versions of the dynamics. These concrete MCs are functionally bisimilar to their abstract counterpart and admit a simpler description of their invariant probability (equivalently, of their energy function). This can sometimes reveal interesting equilibrium properties of the original chain.

To see how the benefits of the construction come about, and fix a few notations which we will re-use in the main development, we start with a simple class of ‘urn models’. These are traditionally introduced as discrete models of diffusion.

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

Access this chapter

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. Baldan, P., Bruni, R., Montanari, U.: Pre-nets, read arcs and unfolding: a functorial presentation (2002)

    Google Scholar 

  2. Blute, R., Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled markov processes. In: 12th Annual IEEE Symposium on Logic in Computer Science, LICS 1997 Proceedings, pp. 149–158 (1997)

    Google Scholar 

  3. Buchholz, P.: Exact and ordinary lumpability in finite markov chains. Journal of Applied Probability 31(1), 59–75 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Buchholz, P.: Bisimulation relations for weighted automata. Theoretical Computer Science 393(1-3), 109–123 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Danos, V., Oury, N.: Equilibrium and termination ii: the case of petri nets. Mathematical Structures in Computer Science 23, 290–307 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: An algebraic approach. In: SWAT (FOCS), pp. 167–180 (1973)

    Google Scholar 

  7. Feret, J., Henzinger, T., Koeppl, H., Petrov, T.: Lumpability abstractions of rule-based systems. Theoretical Computer Science 431(0), 137–164 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Giry, M.: A categorical approach to probability theory. In: Mosses, P.D., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 68–85. Springer, Heidelberg (1995)

    Google Scholar 

  9. Heindel, T.: A category theoretical approach to the concurrent semantics of rewriting: adhesive categories and related concepts. PhD thesis (2009)

    Google Scholar 

  10. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. In: Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL), pp. 344–352 (1989)

    Google Scholar 

  11. Lawvere, F.W.: The category of probabilistic mappings - with applications to stochastic processes, statistics, and pattern recognition. Seminar Handout Notes (1962)

    Google Scholar 

  12. Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77, 541–580 (1989)

    Article  Google Scholar 

  13. Norris, J.R.: Markov chains. Cambridge series in statistical and probabilistic mathematics. Cambridge University Press (1998)

    Google Scholar 

  14. Panangaden, P.: Probabilistic relations. In: School of Computer Science, McGill University, Montreal, pp. 59–74 (1998)

    Google Scholar 

  15. Panangaden, P.: Labelled Markov Processes. Imperial College Press (2009)

    Google Scholar 

  16. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1. World Scientific (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Danos, V., Garnier, I. (2014). Free Energy of Petri Nets. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds) Horizons of the Mind. A Tribute to Prakash Panangaden. Lecture Notes in Computer Science, vol 8464. Springer, Cham. https://doi.org/10.1007/978-3-319-06880-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06880-0_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06879-4

  • Online ISBN: 978-3-319-06880-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics