Abstract
Analyzing the propagation of faults is part of the preliminary safety assessment for complex safety-critical systems. A recent work proposes an smt-based approach to deal with propagation of faults in presence of circular dependencies. The set of all the fault configurations that cause the violation of a property, also referred to as the set of minimal cut sets, is computed by means of repeated calls to the smt solver, hence enumerating all minimal models of an smt formula. Circularity is dealt with by imposing a strict temporal order, using the theory of difference logic.
In this paper, we explore the use of Answer-Set Programming to tackle the same problem. We propose two encodings, leveraging the notion of stable model. The first approach deals with cycles in the encoding, while the second relies on asp Modulo Acyclicity (aspma).
We experimentally evaluate the three approaches on a comprehensive set of benchmarks. The first asp-based encoding significantly outperforms the smt-based approach; the aspma-based encoding, on the other hand, does not yield the expected performance gains.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This can be achieved, e.g., by adding a directive #show fail_local/1. and calling clingo –project –heuristic=Domain –dom-mod=5,16 –enum-mod=domRec 0.
References
Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 825–885. IOS Press (2009)
Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., Schaub, T.: Answer set programming modulo acyclicity. Fundam. Inform. 147(1), 63–91 (2016)
Bozzano, M., Cimatti, A., Griggio, A., Jonáš, M.: Efficient analysis of cyclic redundancy architectures via boolean fault propagation. In TACAS, vol. 13244, LNCS, Springer, Cham (2022)
Bozzano, M., Cimatti, A., Fernandes Pires, A., Griggio, A., Jonáš, M., Kimberly, G.: Efficient SMT-based analysis of failure propagation. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12760, pp. 209–230. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-81688-9_10
Brewka, G., Delgrande, J.,Romero, J., Schaub, T.: asprin: Customizing answer set preferences without a headache. In: AAAI, pp. 1467–1474, AAAI, Press (2015)
Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 93–107. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36742-7_7
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. CoRR, abs/1705.09811 (2017)
Gebser, M., Kaufmann, B., Schaub, T.: Advanced conflict-driven disjunctive answer set solving. In: IJCAI (2013)
Di Rosa, E., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints An Int. J. 15(4), 485–515 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bozzano, M., Cimatti, A., Griggio, A., Jonáš, M., Kimberly, G. (2022). Analysis of Cyclic Fault Propagation via ASP. In: Gottlob, G., Inclezan, D., Maratea, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2022. Lecture Notes in Computer Science(), vol 13416. Springer, Cham. https://doi.org/10.1007/978-3-031-15707-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-031-15707-3_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15706-6
Online ISBN: 978-3-031-15707-3
eBook Packages: Computer ScienceComputer Science (R0)