Author:
Larotonda Marco,Primiero Giuseppe
Abstract
AbstractWe present the three-valued modal logic DBBL-BI$$_{n}$$ to formally express information transmission among ordered agents bounded by limited access to repositories and where secrecy is admissible, viz. agents are not forced to transmit every data they possess to everyone else. The language, along with standard formulae for information holding at reachable states, includes formulae for agent and group information transmission, as well as assertion of trustworthy information. The description of information accessibility and transmission among agents is represented by formulae that hold in virtue of two distinct kinds of relations. We illustrate the application of the formal system with some intuitive examples.
Publisher
Springer International Publishing
Reference27 articles.
1. Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. J. ACM 52(1), 102–146 (2005). https://doi.org/10.1145/1044731.1044735
2. Abadi, M., Burrows, M., Lampson, B., Plotkin, G.: A calculus for access control in distributed systems. ACM Trans. Program. Lang. Syst. (TOPLAS) 15(4), 706–734 (1993)
3. Lecture Notes in Computer Science;A Aldini,2020
4. Alechina, N., Bulling, N., Demri, S., Logan, B.: On the complexity of resource-bounded logics. Theor. Comput. Sci. 750, 69–100 (2018). https://doi.org/10.1016/j.tcs.2018.01.019, https://www.sciencedirect.com/science/article/pii/S0304397518300665. reachability Problems: Special Issue
5. Alechina, N., Bulling, N., Logan, B., Nguyen, H.N.: On the boundary of (un) decidability: decidable model-checking for a fragment of resource agent logic. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献