A three-valued model abstraction framework for PCTL* stochastic model checking (original) (raw)
References
Abraham, E., Becker, B., Dehnert, C., Jansen, N., Katoen, J.P., Wimmer, R.: Counterexample generation for discrete-time Markov models: an introductory survey. In: Proceedings of the 14th International School on Formal Methods for the Design of Computer, Communication and Software Systems: Executable Software Models (SFM-14:ESM), Springer, vol. 8483 of LNCS, pp. 65–121 (2014)
Albanese, M., Chellappa, R., Moscato, V., Picariello, A., et al.: A Constrained probabilistic petri net framework for human activity detection in video. IEEE Trans. Multimedia 10(8), 1429–1443 (2008) Article Google Scholar
Alfaro, L., Roy, P.: Magnifying-lens abstraction for Markov decision processes. In: Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07). Springer, vol. 4590 of LNCS, pp. 325–338 (2007)
Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008) MATH Google Scholar
Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Proceedings of the 9th International Conference on Computer Aided Verification. Springer-Verlag, Berlin, Heidelberg, pp. 119–130 (1997)
Baier, C., Groser, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: Proceedings of the 1st International Conference on Quantitative Evaluation of Systems. IEEE Computer Society Press, Washington, pp. 230–239 (2004)
Baier, C., D’Argenio, P., Groesser, M.: Partial order reduction for probabilistic branching time. Electron. Notes Theor. Comput. Sci. 153(2), 97–116 (2005b) Article Google Scholar
Belardinelli, F., Lomuscio, A., Malvone, V.: An abstraction-based method for verifying strategic properties in multi-agent systems with imperfect information. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 6030–6037 (2019)
Bernemann, R., Cabrera, B., Heckel, R., König, B.: Uncertainty reasoning for probabilistic petri nets via Bayesian networks, pp. 1–26 (2020) available: https://arxiv.org/abs/2009.14817
Chadha, R., Viswanathan, M.: A counterexample guided abstraction-refinement framework for Markov decision processes. ACM Trans. Comput. Logic 12(1), 1–49 (2010) ArticleMathSciNetMATH Google Scholar
Chi, T., Chen, M.: A frequency hopping method for spatial RFID/WiFi/Bluetooth scheduling in agricultural IoT. Wirel. Netw. 25, 805–817 (2019) Article Google Scholar
Christian, D., Katoen, J.P., Parker, D.: SMT-based bisimulation minimization of Markov models. In: Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation. Springer-Verlag, Berlin, Heidelberg, pp. 28–47 (2013)
Christopher P.: Probabilistic symmetry reduction [Ph.D. Thesis]. University of Glasgow, Scotland (2012)
Ciesinski, F.: High-Level modelling and efficient analysis of randomized protocols [Ph.D. Thesis]. Dresden University of Technology, Dresden (2011)
Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16(5), 1512–1542 (1994a) Article Google Scholar
Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16(5), 1512–1542 (1994b) Article Google Scholar
Clarke, E.M., Jha, S., Enders, R., Filkorn, T.: Exploiting symmetry in temporal logic model checking. Form. Methods Syst. Des. 9(1–2), 77–104 (1996) Article Google Scholar
Clarke, E., Gupta, A., Kukula, J., Strichman, O.: SAT based abstraction-refinement using ILP and machine learning techniques. In: Proceedings of Conference on Computer-Aided Verification, Copenhagen, Denmark (2002)
Clarke, E.M., Emerson, E.A., Sifakis, J.: Model checking: algorithmic verification and debugging. Commun. ACM 52(11), 74–84 (2009) Article Google Scholar
Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R., et al.: Handbook of Model Checking. Springer, Heidelberg (2018) BookMATH Google Scholar
D’Argenio, P.R., Niebert, P.: Partial order reduction on concurrent probabilistic programs. In: Proceedings of the 1st International Conference on Quantitative Evaluation of Systems. IEEE Computer Society Press, Washington, pp. 240–249 (2004)
Dams, D., Grumberg, O.: Abstraction and abstraction refinement. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018) Google Scholar
Dehnert C.: The probabilistic model checker storm: symbolic methods for probabilistic model checking. PhD Thesis at RWTH Aachen University (2018)
Derisavi, S.: A symbolic algorithm for optimal Markov chain lumping. In: Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, Berlin, Heidelberg, pp. 139–154 (2007)
Dey, D., Dansana, J., Behura, A.: A survey of datalink layer protocol for IoT. In: Smys, S., Senjyu, T., Lafata, P. (eds) Second International Conference on Computer Networks and Communication Technologies, pp. 459–466 (2020)
Didier, F., Henzinger, T., Mateescu, M., Wolf, V.: Sabre: a tool for stochastic analysis of biochemical reaction networks. In: Proceedings of the 7th International Conference on the Quantitative Evaluation of Systems (QEST'10), pp. 193–194. IEEE CS Press (2010)
Donaldson, A., Miller, A.: Symmetry reduction for probabilistic model checking using generic representatives. In: Proceedings of the 4th International Conference on Automated Technology for Verification and Analysis. Springer-Verlag, Berlin, Heidelberg, pp. 9–23 (2006)
Donaldson, A., Miller, A., Parker, D.: Language-level symmetry reduction for probabilistic model checking. In: Proceedings of the 6th International Conference on Quantitative Evaluation of Systems. IEEE Computer Science Press, Washington, pp. 289–298 (2009)
Ebert, C., Weyrich, M.: Validation of autonomous systems. IEEE Softw. 36(5), 15–23 (2019) Article Google Scholar
Ejaz, S., Iqbal, Z., Azmat Shah, P., Bukhari, B.H., Ali, A., Aadil, F.: Traffic load balancing using software defined networking (SDN) controller as virtualized network function. IEEE Access 7, 46646–46658 (2019) Article Google Scholar
Emerson, E.A., Wahl, T.: On combining symmetry reduction and symbolic representation for efficient model checking. In: Proceedings of the 12th IFIP WG Advanced Research Working Conference on Correct Hardware Design and Verification Methods. Springer-Verlag, Berlin, Heidelberg, pp. 216–230 (2003)
Emerson, E.A., Sistla, A.: Symmetry and model checking. Form. Methods Syst. Des. 9(1–2), 105–131 (1996) Article Google Scholar
Emerson, E.A., Wahl, T.: Efficient reduction techniques for systems with many components. Electron. Notes Theor. Comput. Sci. 130, 379–399 (2005a) ArticleMATH Google Scholar
Emerson, E.A., Wahl, T.: Dynamic symmetry reduction. In: Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, Berlin, Heidelberg, pp. 382–396 (2005b)
Evangelidis A.: Verified control and estimation for cloud computing. Ph.D. thesis, School of Computer Science, University of Birmingham (2020)
Fecher, H., Leucker, M., Wolf, V.: Don’t know in probabilistic systems. In: Proceedings of the 13th International Conference on Model Checking Software. Springer-Verlag, Berlin, Heidelberg, pp. 71–88 (2006)
Fernandez-Diaz, A., Baier, C., Benac-Earle, C., Fredlund, L.A.: Static partial order reduction for probabilistic concurrent systems. In: Proceedings of the 9th International Conference on Quantitative Evaluation of Systems. IEEE Computer Science Press, Washington, pp. 104–113 (2012)
Ferrer, F.L.M., Hashemi, V., Hermanns, H., Turrini, A.: Deciding probabilistic automata weak bisimulation: theory and practice. Form. Asp. Comput. 28, 109–143 (2016) ArticleMathSciNetMATH Google Scholar
Filieri, A., Ghezzi, C., Tamburrelli, G.: Run-time efficient probabilistic model checking. In: Proceedings of the 33rd ACM/IEEE International Conference on Software Engineering. Honolulu, HI, USA, pp. 341–350 (2011)
Fremont, D.J., Chiu, J., Margineantu, D.D., Osipychev, D., Seshia, S.A.: Formal analysis and redesign of a neural network-based aircraft taxiing system with VerifAI. In: 32nd International Conference on Computer Aided Verification (CAV), July (2020)
Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial order approach to branching time logic model checking. In: Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems. IEEE Computer Society Press, Washington, pp. 130–139 (1995)
Hahn, E.M., Hermanns, H., Wachter, B., Zhang, L.J.: PASS: abstraction refinement for infinite probabilistic models. In: Proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, Berlin, Heidelberg, pp. 353–357 (2010)
Hansen, H., Wang, X.: Compositional analysis for weak stubborn sets. In: Proceedings of the International Conference on Application of Concurrency to System Design. IEEE Computer Science Press, Washington, pp. 36–43 (2011)
Hansen, H., Kwiatkowska, M., Qu, H.: Partial order reduction for model checking Markov decision processes under unconditional fairness. In: Proceedings of the 8th International Conference on Quantitative Evaluation of SysTems. IEEE Computer Science Press, Washington, pp. 203–212 (2011)
Hark, M., Kaminski, B.L., Giesl, J., Katoen, J.P.: Aiming low is harder: induction for lower bounds in probabilistic program verification. In: Proceedings of the ACM Programming Language, POPL, Article 37, vol. 4, pp. 1–28 (2020)
Hartmanns, A., Junges, S., Katoen, J.P., Quatmann, T.: Multi-cost bounded reachability in MDPs. In: Proceedings of the of TACAS, vol 10805 of LNCS (2018)
He, F., Song, X., Hung, W.N.N., et al.: Integrating evolutionary computation with abstraction refinement for model checking. IEEE Trans. Comput. 59(1), 116–126 (2010) ArticleMathSciNetMATH Google Scholar
He, F., Gao, X., Wang, M., Wang, B.Y., Zhang, L.J.: Learning weighted assumptions for compositional verification of Markov decision processes. ACM Trans. Softw. Eng. Methodol. 25(3), 39 (2016) Article Google Scholar
Hermanns, H., Katoen, J.: Automated compositional Markov chain generation for a plain-old telephone system. Sci. Comput. Program. 36(1), 97–127 (2000) ArticleMATH Google Scholar
Hermanns, H., Turrini, A.: Deciding probabilistic automata weak bisimulation in polynomial time. In: Proceedings of the 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science. Saarbrücken/Wadern: Dagstuhl Publishing, pp. 435–447 (2012)
Hermanns, H., Wachter, B., Zhang, L.: Probabilistic CEGAR. In: Proceedings of 2008 the 20th International Conference on Computer Aided Verification. Springer-Verlag, Berlin, Heidelberg, pp. 162–175 (2007)
Huang, M., Fu, H., Katoen, J.P.: Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems. Inf. Comput. 268, 104431 (2019) ArticleMathSciNetMATH Google Scholar
Huynh, T., Tian, L.: On some equivalence relations for probabilistic processes. Fundam. Inform. 17(3), 211–234 (1992) ArticleMathSciNetMATH Google Scholar
Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Washington, pp. 266–277 (1991)
Kamaleson, N.: Model reduction techniques for probabilistic verification of Markov chains. Ph.D. thesis, University of Birmingham (2018)
Katoen, J.P., Sher, F.: Modal stochastic games: abstraction-refinement of probabilistic automata. In: Models, Algorithms, Logics and Tools (Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday). LNCS, Springer, vol. 10460, pp. 426–448 (2017)
Katoen, J.P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for probabilistic systems. J. Logic Algebraic Program. 81(4), 356–389 (2012) ArticleMathSciNetMATH Google Scholar
Kattenbelt, M., Kwiatkowska, M., Norman, G., Parker, D.: A game-based abstraction refinement framework for Markov decision processes. Form. Methods Syst. Des. 36(3), 246–280 (2010) ArticleMATH Google Scholar
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Kwiatkowska, M.: Safety verification for deep neural networks with provable guarantees. In: Proceedings of the 30th International Conference on Concurrency Theory, pp. 1–5 (2019)
Kwiatkowska, M., Norman, G., Parker, D.: Symmetry reduction for probabilistic model checking. In: Proceedings of the 18th International Conference on Computer Aided Verification. Springer-Verlag, Berlin, Heidelberg, pp. 234–248 (2006a)
Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: Proceedings of the 3rd International Conference on Quantitative Evaluation of Systems. IEEE Computer Science Press, Washington, pp. 157–166 (2006b)
Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Proceedings of the 23rd International Conference on Computer Aided Verification. Springer-Verlag, Berlin, Heidelberg, pp. 585–591 (2011)
Kwiatkowska, M., Norman, G., Parker, D.: Symbolic verification and strategy synthesis for linearly-priced probabilistic timed automata. In: Aceto, L., Bacci, G., Bacci, G., Ingólfsdóttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools, vol. 10460, pp. 289–309. Springer, Cham (2017) ChapterMATH Google Scholar
Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: PRISM-games 3.0: stochastic game verification with concurrency, equilibria and time. In: Proceedings of the 32nd International Conference on Computer Aided Verification (CAV'20), Springer, vol. 12225 of LNCS, pp. 475–487 (2020)
Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic model checking and autonomy. Annu. Rev. Control Robot. Auton. Syst. 5, 1–26 (2022) Article Google Scholar
Lacerda, B., Faruq, F., Parker, D., Hawes, N.: Probabilistic planning with formal performance guarantees for mobile service robots. Int. J. Robot. Res. 38(9), 1098–1123 (2019) Article Google Scholar
Liu, Y.: Secure deep learning engineering: a road towards quality assurance of intelligent systems. In: The 21st International Conference on Formal Engineering Methods, November 5th–9th (2019)
Liu, Y., Sun, J., Dong, J.S.: PAT 3: an extensible architecture for building multi-domain model checkers. In: The 22nd annual International Symposium on Software Reliability Engineering (ISSRE 2011), Hiroshima, Japan, pp. 190–199, Nov 29–Dec 2 (2011)
Liu, Y., Li, X.D., Ma, Y.: Model abstraction for stochastic model checking. Ruan Jian Xue Bao/J. Softw. 26(8), 1853–1870 (2015) MathSciNet Google Scholar
Liu, Y., Li, X.D., Ma, Y.: A game-based approach for PCTL* stochastic model checking with evidence. J. Comput. Sci. Technol. 31(1), 198–216 (2016) ArticleMathSciNet Google Scholar
Luisa, V.L., Loreti, M., Nenzi, L., Hillston, J., Marion, G.: Three-valued spatio-temporal logic: a further analysis on spatio-temporal properties of stochastic systems. In: Proceedings 14th International Conference on Quantitative Evaluation of Systems, pp. 317–332 (2017)
Ma, Y., Cao, Z., Liu, Y.: A Probabilistic assume-guarantee reasoning framework based on genetic algorithm. IEEE Access 7, 83839–83851 (2019a) Article Google Scholar
Ma, Y., Cao, Z., Liu, Y.: A PSO-based CEGAR framework for stochastic model checking. Int. J. Softw. Eng. Knowl. Eng. 29(10), 1465–1495 (2019b) Article Google Scholar
Miller, A., Donaldson, A., Calder, M.: Symmetry in temporal logic model checking. ACM Comput. Surv. 38(3), 8 (2006) Article Google Scholar
Milner, R.: An algebraic definition of simulation between programs. In: Proceedings of the 2nd International Joint Conference on Artificial Intelligence. William Kaufmann Inc., London, pp. 481–489 (1971)
Milner, R.: A Calculus of Communicating Systems. Springer-Verlag, Berlin, Heidelberg (1980) BookMATH Google Scholar
Nguyen, B.H., Xue, B., Andreae, P.: A novel binary particle swarm optimization algorithm and its applications on knapsack and feature selection problems. In: Leu, G., Singh, H., Elsayed, S. (eds.) Intelligent and Evolutionary Systems. Proceedings in Adaptation, Learning and Optimization, vol. 8. Springer, Cham (2017) Google Scholar
Nguyen, B.H., Xue, B., Andreae, P., Zhang, M.: A new binary particle swarm optimization approach: momentum and dynamic balance between exploration and exploitation. IEEE Trans. Cybern. 51(2), 589–603 (2021) Article Google Scholar
Norris, I.P.C., Dill, D.L.: Better verification through symmetry. Form. Methods Syst. Des. 9(1–2), 41–75 (1996) Article Google Scholar
Oxford, M., Parker, D., Ryan, M.: Quantitative verification of certificate transparency gossip protocols. In: Proceedings of the IEEE Conference on Communications and Network Security, France, June 29–July 1, pp. 1–9 (2020)
Paoli, F., Prabaldi, M.: Proof theory of paraconsistent weak Kleene logic. Stud. Logica 4(108), 779–802 (2020) ArticleMathSciNetMATH Google Scholar
Park D.: Concurrency and automata on infinite sequences. In: Proceedings of the 5th GI-Conference on Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, pp. 167–183 (1981)
Peled, D.: All from one, one for all: on model checking using representatives. In: Proceedings of the 5th International Conference on Computer Aided Verification. Springer-Verlag, Berlin, Heidelberg, pp. 409–423 (1993)
Peled, D.: Partial order reduction: linear and branching temporal logics and process algebras. In: Proceedings of the DIMACS Workshop on Partial Order Methods in Verification. AMS Press, New York, pp. 79–88 (1996)
Peled, D., Pratt, V., Holzmann, G.: Partial order methods in verification. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science. (1997)
Petri, C.A.: Introduction to general net theory. In: Brauer, W. (ed.) Lecture Notes in Computer Science 84, pp. 1–19. Springer-Verlag, Berlin, Heidelberg (1979) Google Scholar
Pfeffer, A., Wu, C., Fry, G., Lu, K., et al.: Software adaptation for an unmanned undersea vehicle. IEEE Softw. 36(2), 91–96 (2019) Article Google Scholar
Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Proceedings of the 11th International Conference on Concurrency Theory. Springer-Verlag, Berlin, Heidelberg, pp. 334–349 (2000)
Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2(2), 250–273 (1995) MathSciNetMATH Google Scholar
Shivakumar, S., Torfah, H., Desai, A., Seshia, S.A.: SOTER on ROS: a run-time assurance framework on the robot operating system. In: 20th International Conference on Runtime Verification (RV), October (2020)
Shoham, S., Grumberg, O.: Game-based framework for CTL counterexamples and 3-valued abstraction-refinement. ACM Trans. Comput. Logic (TOCL) 9(1), 1 (2007) ArticleMathSciNetMATH Google Scholar
Valmari, A.: A stubborn attack on state explosion. Form. Methods Syst. Des. 1(4), 297–322 (1992) ArticleMATH Google Scholar
Wachter, B., Zhang, L.J.: Best probabilistic transformers. In: Proceedings of the 11th International Conference on Verification, Model Checking, and Abstract Interpretation. Springer-Verlag, Berlin, Heidelberg, pp. 362–379 (2010)
Wahl, T., Blanc, N., Emerson, E.A.: SVISS: symbolic verification of symmetric systems. In: Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, Berlin, Heidelberg, pp. 459–462 (2008)
Wang, J., Jiang, C., Zhang, H., Ren, Chen K C., Hanzo, L.: Thirty years of machine learning: the road to pareto-optimal wireless networks. IEEE Commun. Surv. Tutor. 22(3), 1472–1514 (2020) Article Google Scholar
Winterer, L., Junges, S., Wimmer, R., Jansen, N., Topcu, U., Katoen, J.P., Becker, B.: Motion planning under partial observability using game-based abstraction. In: IEEE 56th Annual Conference on Decision and Control (CDC), pp. 2201–2208, IEEE (2017)
Winterer, L., Junges, S., Wimmer, R., Jansen, N., Topcu, U., Katoen, J.P., Becker, B.: Strategy synthesis for POMDPs in robot planning via game-based abstractions. IEEE Trans. Autom. Control 66(3), 1040–1054 (2020) ArticleMathSciNetMATH Google Scholar
Younes, H.: Ymer: a statistical model checker. In: Proceedings of the 17th International Conference on Computer Aided Verification (CAV'05), Springer, vol. 3576 of LNCS, pp. 429–433 (2005)