Abstract
According to the principles of compositional verification, verifying that lower-level components satisfy their specification ensures that the whole system satisfies its top-level specification. The key step is to ensure that the lower-level specifications constitute a correct decomposition of the top-level specification. In a non-stochastic context, such decomposition can be analyzed using techniques of theorem proving. In industrial applications, especially in safety-critical systems, specifications are often of stochastic nature, for example, giving a bound on the probability that a system failure will occur before a given time. A decomposition of such a specification requires techniques beyond traditional theorem proving. The first contribution of the paper is a theoretical framework that allows the representation of, and reasoning about, stochastic and timed behavior of systems as well as specifications for such behavior. The framework is based on traces that describe the continuous-time evolution of a system, and specifications are formulated using timed automata combined with probabilistic acceptance conditions. The second contribution is a novel approach to verifying decompositions of such specifications by reducing the problem to checking emptiness of the solution space for a system of linear inequalities.
Article PDF
Similar content being viewed by others
References
de Roever, W.-P.: The need for compositional proof systems: a survey. In: International Symposium on Compositionality, pp. 1–22. Springer, Berlin (1997)
ISO 26262: “Road vehicles - Functional safety”, Geneva, Switzerland (2018)
ISO 21434: “Road vehicles – Cybersecurity engineering”, Geneva, Switzerland (2021)
Cuoq, P., Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-c. In: International Conference on Software Engineering and Formal Methods, pp. 233–247. Springer, Berlin (2012)
Moura, L.d., Bjørner, N.: Z3: an efficient smt solver. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 337–340. Springer, Berlin (2008)
Nyberg, M., Westman, J., Gurov, D.: Formally proving compositionality in industrial systems with informal specifications. In: International Symposium on Leveraging Applications of Formal Methods, pp. 348–365. Springer, Berlin (2020)
Slind, K., Norrish, M.: A brief overview of HOL4. In: International Conference on Theorem Proving in Higher Order Logics, pp. 28–32. Springer, Berlin (2008)
Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Verifying continuous time Markov chains. In: International Conference on Computer Aided Verification, pp. 269–276. Springer, Berlin (1996)
Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous-time Markov chains. ACM Trans. Comput. Log. 1(1), 162–170 (2000)
Grunske, L.: Specification patterns for probabilistic quality properties. In: 2008 ACM/IEEE 30th International Conference on Software Engineering, pp. 31–40. IEEE (2008)
Benveniste, A., Caillaud, B., Ferrari, A., Mangeruca, L., Passerone, R., Sofronis, C.: Multiple viewpoint contract-based specification and design. In: Formal Methods for Components and Object, pp. 200–225. Springer, Berlin (2008)
Meyer, B.: Applying ‘design by contract’. Computer 25(10), 40–51 (1992)
Westman, J., Nyberg, M.: Conditions of contracts for separating responsibilities in heterogeneous systems. Form. Methods Syst. Des. (2017). https://doi.org/10.1007/s10703-017-0294-7
Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., Wasowski, A.: Compositional design methodology with constraint Markov chains. In: 2010 Seventh International Conference on the Quantitative Evaluation of Systems, pp. 123–132. IEEE (2010)
Delahaye, B., Caillaud, B., Legay, A.: Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects. Form. Methods Syst. Des. 38(1), 1–32 (2011)
Delahaye, B., Katoen, J.-P., Larsen, K.G., Legay, A., Pedersen, M.L., Sher, F., Wąsowski, A.: Abstract probabilistic automata. In: International Workshop on Verification, Model Checking, and Abstract Interpretation, pp. 324–339. Springer, Berlin (2011)
Gössler, G., Xu, D.N., Girault, A.: Probabilistic contracts for component-based design. Form. Methods Syst. Des. 41(2), 211–231 (2012)
Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proceedings 1991 Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 266–267. IEEE Comput. Soc., Los Alamitos (1991)
Jonsson, B., Yi, W.: Testing preorders for probabilistic processes can be characterized by simulations. Theor. Comput. Sci. 282(1), 33–51 (2002)
Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Parametric probabilistic transition systems for system design and analysis. Form. Asp. Comput. 19(1), 93–109 (2007)
Nuzzo, P., Li, J., Sangiovanni-Vincentelli, A.L., Xi, Y., Li, D.: Stochastic assume-guarantee contracts for cyber-physical system design. ACM Trans. Embed. Comput. Syst. 18(1), 1–26 (2019)
Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: International Conference on Concurrency Theory, pp. 481–496. Springer, Berlin (1994)
Hampus, A., Nyberg, M.: Formally verifying decompositions of stochastic specifications. In: Formal Methods for Industrial Critical Systems: 27th International Conference, FMICS 2022, Proceedings, Warsaw, Poland, September 14–15, 2022, pp. 193–210. Springer, Berlin (2022)
Nyberg, M., Westman, J., Gurov, D.: Formally proving compositionality in industrial systems with informal specifications. In: International Symposium on Leveraging Applications of Formal Methods, pp. 348–365. Springer, Berlin (2020)
Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116–146 (1996)
Heymann, M., Lin, F., Meyer, G., Resmerita, S.: Analysis of Zeno behaviors in a class of hybrid systems. IEEE Trans. Autom. Control 50(3), 376–383 (2005)
Ben-Gal, I.: Bayesian networks. Encyclopedia of statistics in quality and reliability (2008)
Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)
Resnick, S.: A Probability Path. Birkhäuser, Boston (2019)
Alur, R., Dill, D.: Automata for modeling real-time systems. In: International Colloquium on Automata, Languages, and Programming, pp. 322–335. Springer, Berlin (1990)
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
Alur, R.: Timed automata. In: Computer Aided Verification: 11th International Conference, CAV’99, Proceedings 11, Trento, Italy, July 6–10, 1999, pp. 8–22. Springer, Berlin (1999)
Clarke, E.M., Grumberg, O., Kurshan, R.P.: A synthesis of two approaches for verifying finite state concurrent systems. In: International Symposium on Logical Foundations of Computer Science, pp. 81–90. Springer, Berlin (1989)
Kern, C., Greenstreet, M.R.: Formal verification in hardware design: a survey. ACM Trans. Des. Autom. Electron. Syst. 4(2), 123–193 (1999)
Dantzig, G.B.: Origins of the simplex method. In: A History of Scientific Computing, pp. 141–151 (1990)
Nash, J.C.: The (Dantzig) simplex method for linear programming. Comput. Sci. Eng. 2(1), 29–31 (2000)
Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Advanced Course on Petri Nets, pp. 87–124. Springer, Berlin (2003)
Linear Optimization. https://online-optimizer.appspot.com. (Accessed on 05/27/2022)
Mereacre, A., Katoen, J.-P., Han, T., Chen, T.: Model checking of continuous-time Markov chains against timed automata specifications. Log. Methods Comput. Sci. 7 (2011)
Paolieri, M., Horváth, A., Vicario, E.: Probabilistic model checking of regenerative concurrent systems. IEEE Trans. Softw. Eng. 42(2), 153–169 (2015)
Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. Comput. 200(2), 149–214 (2005)
Donatelli, S., Haddad, S., Sproston, J.: Model checking timed and stochastic properties with CSL^{TA}. IEEE Trans. Softw. Eng. 35(2), 224–240 (2008)
David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Timed I/o automata: a complete specification theory for real-time systems. In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, pp. 91–100 (2010)
Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1–37 (1994)
Caleiro, C., Casal, F., Mordido, A.: Generalized probabilistic satisfiability. Electron. Notes Theor. Comput. Sci. 332, 39–56 (2017)
Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertainty and Defeasible Reasoning, pp. 321–367 (2000)
Acknowledgements
Supported by Vinnova FFI, Sweden, through the SafeDim project.
Funding
Open access funding provided by Royal Institute of Technology.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Hampus, A., Nyberg, M. Formally verifying decompositions of stochastic specifications. Int J Softw Tools Technol Transfer 26, 207–228 (2024). https://doi.org/10.1007/s10009-024-00742-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10009-024-00742-5