Skip to main content

2019 | OriginalPaper | Buchkapitel

An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice

verfasst von : Jan Friso Groote, Erik P. de Vink

Erschienen in: From Software Engineering to Formal Methods and Tools, and Back

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In the setting of a simple process language featuring non-deterministic choice and a parallel operator on the one hand and probabilistic choice on the other hand, we propose an axiomatization capturing strong distribution bisimulation. Contrary to other process equivalences for probabilistic process languages, in this paper distributions rather than states are the leading ingredients for building the semantics and the accompanying equational theory, for which we establish soundness and completeness.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Andova, S., Baeten, J.C.M., Willemse, T.A.C.: A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 327–342. Springer, Heidelberg (2006). https://doi.org/10.1007/11817949_22CrossRef Andova, S., Baeten, J.C.M., Willemse, T.A.C.: A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 327–342. Springer, Heidelberg (2006). https://​doi.​org/​10.​1007/​11817949_​22CrossRef
2.
Zurück zum Zitat Andova, S., Willemse, T.A.C.: Branching bisimulation for probabilistic systems: characteristics and decidability. Theor. Comput. Sci. 356, 325–355 (2006)MathSciNetCrossRef Andova, S., Willemse, T.A.C.: Branching bisimulation for probabilistic systems: characteristics and decidability. Theor. Comput. Sci. 356, 325–355 (2006)MathSciNetCrossRef
3.
Zurück zum Zitat Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol. 50. CUP, Cambridge (2010)MATH Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol. 50. CUP, Cambridge (2010)MATH
4.
Zurück zum Zitat Baeten, J.C.M., Bergstra, J.A., Smolka, S.A.: Axiomatizing probabilistic processes: ACP with generative probabilities. Inf. Comput. 121(2), 234–255 (1995)MathSciNetCrossRef Baeten, J.C.M., Bergstra, J.A., Smolka, S.A.: Axiomatizing probabilistic processes: ACP with generative probabilities. Inf. Comput. 121(2), 234–255 (1995)MathSciNetCrossRef
5.
Zurück zum Zitat Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60, 187–231 (2000)MathSciNetCrossRef Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60, 187–231 (2000)MathSciNetCrossRef
8.
Zurück zum Zitat Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control 60(1–3), 109–137 (1984)MathSciNetCrossRef Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control 60(1–3), 109–137 (1984)MathSciNetCrossRef
11.
Zurück zum Zitat Crafa, S., Ranzato, F.: Logical characterizations of behavioral relations on transition systems of probability distributions. ACM Trans. Comput. Logic 16(1), 2:1–2:24 (2014)MathSciNetCrossRef Crafa, S., Ranzato, F.: Logical characterizations of behavioral relations on transition systems of probability distributions. ACM Trans. Comput. Logic 16(1), 2:1–2:24 (2014)MathSciNetCrossRef
14.
Zurück zum Zitat Deng, Y., Palamidessi, C.: Axiomatizations for probabilistic finite-state behaviors. Theor. Comput. Sci. 373, 92–114 (2007)MathSciNetCrossRef Deng, Y., Palamidessi, C.: Axiomatizations for probabilistic finite-state behaviors. Theor. Comput. Sci. 373, 92–114 (2007)MathSciNetCrossRef
15.
Zurück zum Zitat Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 309–337. Springer, Heidelberg (2005). https://doi.org/10.1007/11601548_17CrossRef Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 309–337. Springer, Heidelberg (2005). https://​doi.​org/​10.​1007/​11601548_​17CrossRef
17.
Zurück zum Zitat Fischer, N., van Glabbeek, R.: Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Log. Algebr. Methods Program. 102, 64–102 (2019)MathSciNetCrossRef Fischer, N., van Glabbeek, R.: Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Log. Algebr. Methods Program. 102, 64–102 (2019)MathSciNetCrossRef
18.
Zurück zum Zitat Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Broy, M. (ed.) Proceedings of IFIP WG 2.2 & 2.3 Working Conference on Programming Concepts and Methods, pp. 443–458 (1990) Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Broy, M. (ed.) Proceedings of IFIP WG 2.2 & 2.3 Working Conference on Programming Concepts and Methods, pp. 443–458 (1990)
19.
20.
Zurück zum Zitat Gnesi, S., Larosa, S.: A sound and complete axiom system for the logic ACTL. In: De Santis, A. (ed.) Proceedings of ICTCS 1995, Ravello, 9–11 November 1995, pp. 291–306 (1995) Gnesi, S., Larosa, S.: A sound and complete axiom system for the logic ACTL. In: De Santis, A. (ed.) Proceedings of ICTCS 1995, Ravello, 9–11 November 1995, pp. 291–306 (1995)
21.
Zurück zum Zitat Groote, J.F., Rivera Verduzco, H.J., de Vink, E.P.: An efficient algorithm to determine probabilistic bisimulation. Algorithms 11(9), 131–1-22 (2018)MathSciNetCrossRef Groote, J.F., Rivera Verduzco, H.J., de Vink, E.P.: An efficient algorithm to determine probabilistic bisimulation. Algorithms 11(9), 131–1-22 (2018)MathSciNetCrossRef
22.
Zurück zum Zitat Groote, J.F., de Vink, E.P.: A complete axiomatization of branching bisimulation for a simple process language with probabilistic choice, Submitted Groote, J.F., de Vink, E.P.: A complete axiomatization of branching bisimulation for a simple process language with probabilistic choice, Submitted
24.
Zurück zum Zitat Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proceedings of RTSS 1990, pp. 278–287. IEEE (1990) Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proceedings of RTSS 1990, pp. 278–287. IEEE (1990)
25.
26.
Zurück zum Zitat Hillston, J.: A compositional approach to performance modelling. Ph.D thesis, University of Edinburgh (1994) Hillston, J.: A compositional approach to performance modelling. Ph.D thesis, University of Edinburgh (1994)
27.
29.
Zurück zum Zitat Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)MATH Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)MATH
32.
Zurück zum Zitat Segala, R.: Modeling and Verification of Randomzied Distributed Real-Time Systems. Ph.D thesis, MIT (1995). Technical report MIT/LCS/TR-676 Segala, R.: Modeling and Verification of Randomzied Distributed Real-Time Systems. Ph.D thesis, MIT (1995). Technical report MIT/LCS/TR-676
34.
Zurück zum Zitat Stark, E.W., Smolka, S.A.: A complete axiom system for finite-state probabilistic processes. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 571–596. The MIT Press (2000) Stark, E.W., Smolka, S.A.: A complete axiom system for finite-state probabilistic processes. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 571–596. The MIT Press (2000)
35.
Zurück zum Zitat Valmari, A.: Simple bisimilarity minimization in O(mlogn) time. Fundamenta Informaticae 105(3), 319–339 (2010)MathSciNetMATH Valmari, A.: Simple bisimilarity minimization in O(mlogn) time. Fundamenta Informaticae 105(3), 319–339 (2010)MathSciNetMATH
Metadaten
Titel
An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice
verfasst von
Jan Friso Groote
Erik P. de Vink
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-30985-5_26

Premium Partner