Abstract
We study general equational characterizations for bisimulation and trace semantics via the respective post-/pre-metaequivalences defined on the ULTraS metamodel. This yields axiomatizations encompassing those appeared in the literature, as well as new ones, for bisimulation and trace equivalences when applied to specific classes of processes. The equational laws are developed incrementally, by starting with some core axioms and then singling out additional axioms for bisimulation post-/pre-metaequivalences on the one hand, and different additional axioms for trace post-/pre-metaequivalences on the other hand. The axiomatizations highlight the fundamental differences in the discriminating power between bisimulation semantics and trace semantics, regardless of specific classes of processes. Moreover, they generalize idempotency laws of bisimilarity and choice-deferring laws of trace semantics, in addition to formalizing shuffling laws for pre-metaequivalences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aceto, L., Bloom, B., Vaandrager, F.: Turning SOS rules into equations. Inf. Comput. 111, 1–52 (1994)
Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, pp. 197–292. Elsevier (2001)
Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126, 183–235 (1994)
Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 370–381. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-48224-5_31
Bergstra, J.A., Klop, J.W., Olderog, E.R.: Readies and failures in the algebra of communicating processes. SIAM J. Comput. 17, 1134–1177 (1988)
Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier, Amsterdam (2001)
Bernardo, M.: ULTraS at work: compositionality metaresults for bisimulation and trace semantics. J. Log. Algebraic Methods Program. 94, 150–182 (2018)
Bernardo, M.: Coherent resolutions of nondeterminism. In: Gribaudo, M., Iacono, M., Phung-Duc, T., Razumchik, R. (eds.) EPEW 2019. LNCS, vol. 12039, pp. 16–32. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-44411-2_2
Bernardo, M.: Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism. In: Gribaudo, M., Jansen, D.N., Remke, A. (eds.) QEST 2020. LNCS, vol. 12289, pp. 35–53. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59854-9_5
Bernardo, M., De Nicola, R., Loreti, M.: A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences. Inf. Comput. 225, 29–82 (2013)
Bernardo, M., De Nicola, R., Loreti, M.: Revisiting trace and testing equivalences for nondeterministic and probabilistic processes. Log. Methods Comput. Sci. 10(1:16), 1–42 (2014)
Bernardo, M., De Nicola, R., Loreti, M.: Relating strong behavioral equivalences for processes with nondeterminism and probabilities. Theoret. Comput. Sci. 546, 63–92 (2014)
Bernardo, M., De Nicola, R., Loreti, M.: Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes. Acta Informatica 52(1), 61–106 (2014). https://doi.org/10.1007/s00236-014-0210-1
Bernardo, M., Sangiorgi, D., Vignudelli, V.: On the discriminating power of testing equivalences for reactive probabilistic systems: results and open problems. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 281–296. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10696-0_23
Bernardo, M., Tesei, L.: Encoding timed models as uniform labeled transition systems. In: Balsamo, M.S., Knottenbelt, W.J., Marin, A. (eds.) EPEW 2013. LNCS, vol. 8168, pp. 104–118. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40725-3_9
Bonchi, F., Sokolova, A., Vignudelli, V.: The theory of traces for systems with nondeterminism and probability. In: Proceedings of the 34th ACM/IEEE Symposium on Logic in Computer Science (LICS 2019), vol. 19, no. 62, pp. 1–14. IEEE-CS Press (2019)
Bonsangue, M.M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. Comput. Logic 14(1:7), 1–52 (2013)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31, 560–599 (1984)
D’Argenio, P.R., Gebler, D., Lee, M.D.: Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 289–303. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54830-7_19
De Nicola, R., Latella, D., Loreti, M., Massink, M.: A uniform definition of stochastic process calculi. ACM Comput. Surv. 46(1:5), 1–35 (2013)
Deng, Y., van Glabbeek, R., Morgan, C., Zhang, C.: Scalar outcomes suffice for finitary probabilistic testing. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 363–378. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71316-6_25
Derman, C.: Finite State Markovian Decision Processes. Academic Press, Cambridge (1970)
Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5
Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: Proceedings of the 25th IEEE Symposium on Logic in Computer Science (LICS 2010), pp. 342–351. IEEE-CS Press (2010)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6, 512–535 (1994)
Hermanns, H.: Interactive Markov Chains. LNCS, vol. 2428. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45804-2
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Jonsson, B., Ho-Stuart, C., Yi, W.: Testing and refinement for nondeterministic and probabilistic processes. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994. LNCS, vol. 863, pp. 418–430. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58468-4_176
Jou, C.-C., Smolka, S.A.: Equivalences, congruences, and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 367–383. Springer, Heidelberg (1990). https://doi.org/10.1007/BFb0039071
Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19, 371–384 (1976)
Klin, B.: Structural operational semantics for weighted transition systems. In: Palsberg, J. (ed.) Semantics and Algebraic Specification. LNCS, vol. 5700, pp. 121–139. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04164-8_7
Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoret. Comput. Sci. 282, 101–150 (2002)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94, 1–28 (1991)
Latella, D., Massink, M., de Vink, E.: Bisimulation of labelled state-to-function transition systems coalgebraically. Log. Methods Comput. Sci. 11(4:16), 1–40 (2015)
Lynch, N., Segala, R., Vaandrager, F.: Compositionality for probabilistic automata. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 208–221. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45187-7_14
Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28, 439–466 (1984)
Parma, A., Segala, R.: Axiomatization of trace semantics for stochastic nondeterministic processes. In: Proceedings of the 1st International Conference on the Quantitative Evaluation of Systems (QEST 2004), pp. 294–303. IEEE-CS Press (2004)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (1994)
Rabinovich, A.: A complete axiomatisation for trace congruence of finite state behaviors. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 530–543. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58027-1_25
Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis (1995)
Segala, R.: A compositional trace-based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 234–248. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60218-6_17
Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481–496. Springer, Heidelberg (1994). https://doi.org/10.1007/978-3-540-48654-1_35
Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Quantitative Kleene coalgebras. Inf. Comput. 209, 822–849 (2011)
Silva, A., Sokolova, A.: Sound and complete axiomatization of trace semantics for probabilistic systems. In: Proceedings of the 27th International Conference on the Mathematical Foundations of Programming Semantics (MFPS 2011). ENTCS, vol. 276, pp. 291–311. Elsevier (2011)
Song, L., Zhang, L., Godskesen, J.C., Nielson, F.: Bisimulations meet PCTL equivalences for probabilistic automata. Log. Methods Comput. Sci. 9(2:7), 1–34 (2013)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)
Tracol, M., Desharnais, J., Zhioua, A.: Computing distances between probabilistic automata. In: Proceedings of the 9th International Workshop on Quantitative Aspects of Programming Languages (QAPL 2011). EPTCS, vol. 57, pp. 148–162 (2011)
van Glabbeek, R.J.: The linear time - branching time spectrum I. In: Handbook of Process Algebra, pp. 3–99. Elsevier (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Bernardo, M. (2021). Towards General Axiomatizations for Bisimilarity and Trace Semantics. In: Roggenbach, M. (eds) Recent Trends in Algebraic Development Techniques. WADT 2020. Lecture Notes in Computer Science(), vol 12669. Springer, Cham. https://doi.org/10.1007/978-3-030-73785-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-73785-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73784-9
Online ISBN: 978-3-030-73785-6
eBook Packages: Computer ScienceComputer Science (R0)