Modal Tableaux for Verifying Security Protocols

To develop theories to specify and reason about various aspects of multi-agent systems, many researchers have proposed the use of modal logics such as belief logics, logics of knowledge, and logics of norms. As multi-agent systems operate in dynamic environments, there is also a need to model the evolution of multi-agent systems through time. In order to introduce a temporal dimension to a belief logic, we combine it with a linear-time temporal logic using a powerful technique called fibring for combining logics. We describe a labelled modal tableaux system for a fibred belief logic (FL) which can be used to automatically verify correctness of inter-agent stream authentication protocols. With the resulting fibred belief logic and its associated modal tableaux, one is able to build theories of trust for the description of, and reasoning about, multi-agent systems operating in dynamic environments

Modal tableaux for verifying stream authentication protocols

To develop theories to specify and reason about various aspects of multi-agent systems, many researchers have proposed the use of modal logics such as belief logics, logics of knowledge, and logics of norms. As multi-agent systems operate in dynamic environments, there is also a need to model the evolution of multi-agent systems through time. In order to introduce a temporal dimension to a belief logic, we combine it with a linear-time temporal logic using a powerful technique called fibring for combining logics. We describe a labelled modal tableaux system for the resulting fibred belief logic (FL) which can be used to automatically verify correctness of inter-agent stream authentication protocols. With the resulting fibred belief logic and its associated modal tableaux, one is able to build theories of trust for the description of, and reasoning about, multi-agent systems operating in dynamic environments

Correlation functions of integrable models: a description of the ABACUS algorithm

Recent developments in the theory of integrable models have provided the means of calculating dynamical correlation functions of some important observables in systems such as Heisenberg spin chains and one-dimensional atomic gases. This article explicitly describes how such calculations are generally implemented in the ABACUS C++ library, emphasizing the universality in treatment of different cases coming as a consequence of unifying features within the Bethe Ansatz.Comment: 30 pages, 8 figures, Proceedings of the CRM (Montreal) workshop on Integrable Quantum Systems and Solvable Statistical Mechanics Model

Free Large N Supersymmetric Yang-Mills Theory as a String Theory

The strong version of Maldacena's AdS/CFT conjecture implies that the large N expansion of free N=4 super-YM theory describes an interacting string theory in the extreme limit of high spacetime curvature relative to the string length. String states may then be understood as composed of SYM string bits. We investigate part of the low-lying spectrum of the tensionless (zero-coupling) limit and find a large number of states that are not present in the infinite tension (strong-coupling) limit, notably several massless spin two particles. We observe that all conformal dimensions are N-independent in the free SYM theory, implying that masses in the corresponding string theory are unchanged by string interactions. Degenerate string states do however mix in the interacting string theory because of the complicated N-dependence of general CFT two-point functions. Finally we verify the CFT crossing symmetry, which corresponds to the dual properties of string scattering amplitudes. This means that the SYM operator correlation functions define AdS dual models analogous to the Minkowski dual models that gave rise to string theory.Comment: LaTeX2e, 15 pages, 3 figures, uses youngtab.sty; v2: references on tensionless strings adde

Tableaux for Policy Synthesis for MDPs with PCTL* Constraints

Markov decision processes (MDPs) are the standard formalism for modelling sequential decision making in stochastic environments. Policy synthesis addresses the problem of how to control or limit the decisions an agent makes so that a given specification is met. In this paper we consider PCTL*, the probabilistic counterpart of CTL*, as the specification language. Because in general the policy synthesis problem for PCTL* is undecidable, we restrict to policies whose execution history memory is finitely bounded a priori. Surprisingly, no algorithm for policy synthesis for this natural and expressive framework has been developed so far. We close this gap and describe a tableau-based algorithm that, given an MDP and a PCTL* specification, derives in a non-deterministic way a system of (possibly nonlinear) equalities and inequalities. The solutions of this system, if any, describe the desired (stochastic) policies. Our main result in this paper is the correctness of our method, i.e., soundness, completeness and termination.Comment: This is a long version of a conference paper published at TABLEAUX 2017. It contains proofs of the main results and fixes a bug. See the footnote on page 1 for detail