Combining Paraconsistency and Probability in CTL

Norihiro Kamide, Daiki Koizumi

2015

Abstract

Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic (pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is proven, which indicates that we can reuse existing pCTL-based model checking algorithms. Some illustrative examples involving the use of PpCTL are also presented.

References

  1. Almukdad, A. and Nelson, D. (1984). Constructible falsity and inexact predicates. Journal of Symbolic Logic, 49:231-233.
  2. Aziz, A., Singhal, V., and Balarin, F. (1995). It usually works: The temporal logic of stochastic systems. In Proceedings of the 7th Int. Conf. on Computer Aided Verification (CAV 1995), Lecture Notes in Computer Science 939, pages 155-165.
  3. Bianco, A. and de Alfaro, L. (1995). Model checking of probabilistic and nondeterministic systems. In Proceedings of the 15th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1995), Lecture Notes in Computer Science 1026, pages 499-513.
  4. Carnielli, W., Coniglio, M., Gabbay, D., Gouveia, P., and Sernadas, C. (2008). Analysis and synthesis of logics: How to cut and paste reasoning systems, Applied Logic Series, Vol. 35. Springer.
  5. Chen, D. and Wu, J. (2006). Reasoning about inconsistent concurrent systems: A non-classical temporal logic. In Lecture Notes in Computer Science, volume 3831, pages 207-217.
  6. Clarke, E. and Emerson, E. (1981). Design and synthesis of synchronization skeletons using branching time temporal logic. In Lecture Notes in Computer Science, volume 131, pages 52-71.
  7. Clarke, E., Grumberg, O., and Peled, D. (1999). Model checking. The MIT Press.
  8. Clarke, J. (2009). SQL injection attacks and defense, 2nd Edition. Syngress Publishing.
  9. Easterbrook, S. and Chechik, M. (2001). A framework for multi-valued reasoning over inconsistent viewpoints. In Proceedings of the 23rd International Conference on Software Engineering, pages 411-420.
  10. Gurevich, Y. (1977). Intuitionistic logic with strong negation. Studia Logica, 36:49-59.
  11. Hansson, H. and Jonsson, B. (1994). A logic for reasoning about time and reliability. Formal Aspects of Computing, 6 (5):512-535.
  12. Kamide, N. (2006). Extended full computation tree logics for paraconsistent model checking. Logic and Logical Philosophy, 15 (3):251-276.
  13. Kamide, N. (2013). Modeling and verifying inconsistencytolerant temporal reasoning with hierarchical information: Dealing with students' learning processes. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC 2013), pages 1859-1864.
  14. Kamide, N. and Kaneiwa, K. (2010). Paraconsistent negation and classical negation in computation tree logic. In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence (ICAART 2010), Vol.1, pages 464-469.
  15. Kamide, N. and Wansing, H. (2012). Proof theory of nelson's paraconsistent logic: A uniform perspective. Theoretical Computer Science, 415:1-38.
  16. Kaneiwa, K. and Kamide, N. (2011). Paraconsistent computation tree logic. New Generation Computing, 29 (4):391-408.
  17. Koizumi, D., Matsuda, T., Sonoda, M., and Hirasawa, S. (2012). A learning algorithm of threshold value on the automatic detection of SQL injection attack. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2012), Vol.II, pages 933-937.
  18. Matsuda, T., Koizumi, D., Sonoda, M., and Hirasawa, S. (2011). On predictive errors of SQL injection attack detection by the feature of the single character. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, (SMC 2011), pages 1722-1727.
  19. Nelson, D. (1949). Constructible falsity. Journal of Symbolic Logic, 14:16-26.
  20. Pnueli, A. (1977). The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-57.
  21. Priest, G. and Routley, R. (1982). Introduction: paraconsistent logics. Studia Logica, 43:3-16.
  22. Rautenberg, W. (1979). Klassische und nicht-klassische Aussagenlogik. Vieweg, Braunschweig.
  23. Sonoda, M., Matsuda, T., Koizumi, D., and Hirasawa, S. (2011). On automatic detection of SQL injection attacks by the feature extraction of the single character. In Proceedings of the 4th International Conference on Security of Information and Networks (SIN 2011), pages 81-86.
  24. Vorob'ev, N. (1952). A constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85:465-468.
  25. Wansing, H. (1993). The logic of information structures. In Lecture Notes in Computer Science, volume 681, pages 1-163.
Download


Paper Citation


in Harvard Style

Kamide N. and Koizumi D. (2015). Combining Paraconsistency and Probability in CTL . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-074-1, pages 285-293. DOI: 10.5220/0005180402850293


in Bibtex Style

@conference{icaart15,
author={Norihiro Kamide and Daiki Koizumi},
title={Combining Paraconsistency and Probability in CTL},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2015},
pages={285-293},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005180402850293},
isbn={978-989-758-074-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Combining Paraconsistency and Probability in CTL
SN - 978-989-758-074-1
AU - Kamide N.
AU - Koizumi D.
PY - 2015
SP - 285
EP - 293
DO - 10.5220/0005180402850293