scholarly journals A substructural epistemic resource logic: theory and modelling applications

2019 ◽  
Vol 29 (8) ◽  
pp. 1251-1287
Author(s):  
Didier Galmiche ◽  
Pierre Kimmel ◽  
David Pym
Keyword(s):  
Access Control ◽  
Epistemic Logic ◽  
Epistemic Agency ◽  
Local Resources ◽  
Systems Modelling ◽  
Epistemic Modalities ◽  
Soundness And Completeness ◽  
Resource Semantics

Abstract We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics—we introduce BI and its resource semantics at some length—with epistemic agency. We illustrate the use of the logic in systems modelling by discussing some examples about access control, including semaphores, using resource tokens. We also give a labelled tableaux calculus and establish soundness and completeness with respect to the resource semantics.

scholarly journals EVERYONE KNOWS THAT SOMEONE KNOWS: QUANTIFIERS OVER EPISTEMIC AGENTS

2019 ◽  
Vol 12 (2) ◽  
pp. 255-270 ◽  
Author(s):  
PAVEL NAUMOV ◽  
JIA TAO
Keyword(s):  
Modal Logic ◽  
Epistemic Logic ◽  
Possible Worlds ◽  
Completeness Theorem ◽  
Kripke Semantics ◽  
Possible Worlds Semantics ◽  
Distributed Knowledge ◽  
First Order ◽  
Soundness And Completeness ◽  
First Order Modal Logic

AbstractModal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the first-order modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging over the set of agents, and proves its soundness and completeness with respect to a Kripke semantics.

A cut-free labelled sequent calculus for dynamic epistemic logic

2020 ◽  
Vol 30 (1) ◽  
pp. 321-348
Author(s):  
Shoshin Nomura ◽  
Hiroakira Ono ◽  
Katsuhiko Sano
Keyword(s):  
Modal Logic ◽  
Epistemic Logic ◽  
Sequent Calculus ◽  
Dynamic Epistemic Logic ◽  
Kripke Semantics ◽  
Cut Rule ◽  
Public Announcement ◽  
Public Announcement Logic ◽  
Soundness And Completeness ◽  
Labelled Sequent Calculus

Abstract Dynamic epistemic logic is a logic that is aimed at formally expressing how a person’s knowledge changes. We provide a cut-free labelled sequent calculus ($\textbf{GDEL}$) on the background of existing studies of Hilbert-style axiomatization $\textbf{HDEL}$ of dynamic epistemic logic and labelled calculi for public announcement logic. We first show that the $cut$ rule is admissible in $\textbf{GDEL}$ and show that $\textbf{GDEL}$ is sound and complete for Kripke semantics. Moreover, we show that the basis of $\textbf{GDEL}$ is extended from modal logic K to other familiar modal logics including S5 with keeping the admissibility of cut, soundness and completeness.

scholarly journals A Substructural Modal Logic of Utility

2017 ◽  
Vol 27 (5) ◽  
pp. 1421-1464
Author(s):  
Gabrielle Anderson ◽  
David Pym
Keyword(s):  
Resource Allocation ◽  
Nash Equilibrium ◽  
Modal Logic ◽  
Process Algebra ◽  
Separation Logic ◽  
Cost Strategy ◽  
Soundness And Completeness ◽  
Concurrent Separation Logic ◽  
Resource Semantics ◽  
Best Responses

Abstract We introduce a substructural modal logic of utility that can be used to reason aboutoptimality with respect to properties of states. Our notion of state is quite general, and is able to represent resource allocation problems in distributed systems. The underlying logic is a variant of the modal logic of bunched implications, and based on resource semantics, which is closely related to concurrent separation logic. We consider a labelled transition semantics and establish conditions under which Hennessy—Milner soundness and completeness hold. By considering notions of cost, strategy and utility, we are able to formulate characterizations of Pareto optimality, best responses, and Nash equilibrium within resource semantics. We also show that our logic is able to serve as a logic for a fully featured process algebra and explain the interaction between utility and the structure of processes.

scholarly journals Modal Location-Resource-Process Logic for Access Control

10.29007/5bsb ◽  
2018 ◽  
Author(s):  
David Pym
Keyword(s):  
Modal Logic ◽  
Access Control ◽  
Large Scale ◽  
Process Calculus ◽  
Large Scale Systems ◽  
Systems Modelling

The logic MBI is a substructural modal logic of locations, resources, and processes that is closely related to both the bunched logic BI and Hennessy-Milner logic. MBI stands in a (slightly weak) Hennessy-Milner correspondence with the synchronous process calculus of located resources, LSCRP. Starting from motivations in large-scale systems modelling, I will introduce MBI and LSCRP, and explain how they can be used to address some theoretical and practical questions in access control.

TRANSITIVE PRIMAL INFON LOGIC

2013 ◽  
Vol 6 (2) ◽  
pp. 281-304 ◽  
Author(s):  
CARLOS COTRINI ◽  
YURI GUREVICH
Keyword(s):  
Access Control ◽  
Linear Time ◽  
Kripke Models ◽  
Control Applications ◽  
Traditional Logic ◽  
Soundness And Completeness ◽  
Image Position ◽  
Small Models ◽  
Completeness Theorems ◽  
Subformula Property

AbstractPrimal infon logic was introduced in 2009 in connection with access control. In addition to traditional logic constructs, it contains unary connectives p said indispensable in the intended access control applications. Propositional primal infon logic is decidable in linear time, yet suffices for many common access control scenarios. The most obvious limitation on its expressivity is the failure of the transitivity law for implication: $x \to y$ and $y \to z$ do not necessarily yield $x \to z$. Here we introduce and investigate equiexpressive “transitive” extensions TPIL and TPIL* of propositional primal infon logic as well as their quote-free fragments TPIL0 and TPIL0* respectively. We prove the subformula property for TPIL0* and a similar property for TPIL*; we define Kripke models for the four logics and prove the corresponding soundness-and-completeness theorems; we show that, in all these logics, satisfiable formulas have small models; but our main result is a quadratic-time derivation algorithm for TPIL*.

A distributed access control method for wireless LANs in shadowing environments

2001 ◽  
Vol 84 (9) ◽  
pp. 16-26
Author(s):  
Tadao Saito ◽  
Hitoshi Aida ◽  
Terumasa Aoki ◽  
Soichiro Hidaka ◽  
Tredej Toranawigtrai ◽  
...  
Keyword(s):  
Access Control ◽  
Control Method ◽  
Wireless Lans ◽  
Distributed Access Control

Micro Manufacturing Enterprises: Use of Local Resources

2011 ◽  
Vol 4 (8) ◽  
pp. 68-70
Author(s):  
Dr. P. Siva Kumar ◽  
◽  
B. Bhagavan Reddy
Keyword(s):  
Micro Manufacturing ◽  
Manufacturing Enterprises ◽  
Local Resources

Server Access Control

2012 ◽  
Vol 1 (7) ◽  
pp. 78-79
Author(s):  
Anitha Chepuru ◽  
◽  
Dr.K.Venugopal Rao ◽  
Amardeep Matta
Keyword(s):  
Access Control
Sign in / Sign up

Export Citation Format

Share Document