Skip to main content
SpringerLink
Log in

Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics

  • Conference paper
CONCUR 2012 – Concurrency Theory (CONCUR 2012)

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

Included in the following conference series:

Abstract

We present a method to decompose HML formulae for reactive probabilistic processes. This gives rise to a compositional modal proof system for the satisfaction relation of probabilistic process algebras. The satisfaction problem of a probabilistic HML formula for a process term is reduced to the question of whether its subterms satisfy a derived formula obtained via the operational semantics.

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. Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, pp. 197–292. Elsevier (2001)

    Google Scholar 

  2. Aldini, A., Bravetti, M., Gorrieri, R.: A process-algebraic approach for the analysis of probabilistic noninterference. J. Comput. Secur. 12, 191–245 (2004)

    Google Scholar 

  3. Bacci, G., Miculan, M.: Structural Operational Semantics for Continuous State Probabilistic Processes. In: Pattinson, D., Schröder, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 71–89. Springer, Heidelberg (2012)

    Google Scholar 

  4. Bartels, F.: GSOS for probabilistic transition systems. In: Proc. CMCS 2002. ENTCS, vol. 65, pp. 29–53. Elsevier (2002)

    Google Scholar 

  5. Bergstra, J., Baeten, J., Smolka, S.: Axiomatizing probabilistic processes: ACP with generative probabilities. Inf. Comput. 121, 234–254 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bloom, B., Fokkink, W., van Glabbeek, R.: Precongruence formats for decorated trace semantics. ACM TOCL 5, 26–78 (2004)

    Article  Google Scholar 

  7. Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can’t be traced. J. ACM 42, 232–268 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cardelli, L., Larsen, K.G., Mardare, R.: Modular Markovian Logic. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 380–391. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Clark, K.L.: Negation as failure. In: Logic and Data Bases, pp. 293–322. Plenum Press (1978)

    Google Scholar 

  10. D’Argenio, P.R., Lee, M.D.: Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 452–466. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Fokkink, W., van Glabbeek, R., de Wind, P.: Compositionality of Hennessy-Milner logic by structural operational semantics. Theor. Comput. Sci. 354, 421–440 (2006)

    Article  MATH  Google Scholar 

  12. Giacalone, A., Jou, C., Smolka, S.: Algebraic reasoning for probabilistic concurrent systems. In: Proc. IFIP ProCoMet 1990, pp. 443–458. North-Holland (1990)

    Google Scholar 

  13. van Glabbeek, R.: The meaning of negative premises in transition system specifications II. J. Logic Algebr. Program. 60-61, 229–258 (2004)

    Article  Google Scholar 

  14. van Glabbeek, R.: On cool congruence formats for weak bisimulations. Theor. Comput. Sci. 412, 3283–3302 (2011)

    Article  MATH  Google Scholar 

  15. van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Inf. Comput. 121, 59–80 (1995)

    Article  MATH  Google Scholar 

  16. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32, 137–161 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jonsson, B., Yi, W., Larsen, K.G.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra, pp. 685–710. Elsevier (2001)

    Google Scholar 

  18. Klin, B., Sassone, V.: Structural Operational Semantics for Stochastic Process Calculi. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 428–442. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Klin, B.: Structural operational semantics and modal logic, revisited. In: Proc. CMCS 2010. ENTCS, vol. 264, pp. 155–175. Elsevier (2010)

    Google Scholar 

  20. Lanotte, R., Tini, S.: Probabilistic bisimulation as a congruence. ACM TOCL 10, 1–48 (2009)

    Article  MathSciNet  Google Scholar 

  21. Larsen, K.G.: Context-Dependent Bisimulation Between Processes. Ph.D. thesis, University of Edinburgh (1986)

    Google Scholar 

  22. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94, 1–28 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  23. Larsen, K.G., Xinxin, L.: Compositionality through an operational semantics of contexts. J. Log. Comput. 1, 761–795 (1991)

    Article  MATH  Google Scholar 

  24. Parma, A., Segala, R.: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 287–301. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. thesis, MIT (1995)

    Google Scholar 

  26. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic J. of Computing 2, 250–273 (1995)

    MathSciNet  MATH  Google Scholar 

  27. de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theor. Comput. Sci. 37, 245–267 (1985)

    Article  MATH  Google Scholar 

  28. Tini, S.: Non-expansive epsilon-bisimulations for probabilistic processes. Theor. Comput. Sci. 411, 2202–2222 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  29. Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proc. LICS 1997, pp. 280–291. IEEE (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VU University Amsterdam, The Netherlands

    Daniel Gebler & Wan Fokkink

  2. Eindhoven University of Technology, The Netherlands

    Wan Fokkink

Authors
  1. Daniel Gebler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcastle University, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Department of Computer Science, University of Leicester, Computer Science Building, University Road, LE1 7RH, Leicester, UK

    Irek Ulidowski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gebler, D., Fokkink, W. (2012). Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32940-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32939-5

  • Online ISBN: 978-3-642-32940-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation