A Substructural Modal Logic of Utility

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.

[1]  David J. Pym,et al.  Modelling and simulating systems security policy , 2015, SimuTools.

[2]  David J. Pym,et al.  Algebra and logic for resource-based systems modelling , 2009, Math. Struct. Comput. Sci..

[3]  David J. Pym,et al.  The semantics of BI and resource tableaux , 2005, Mathematical Structures in Computer Science.

[4]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[5]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[6]  Stephen Read,et al.  Relevant Logic: A Philosophical Examination of Inference , 1989 .

[7]  George Coulouris,et al.  Distributed systems - concepts and design , 1988 .

[8]  David J. Pym,et al.  Semantics for structured systems modelling and simulation , 2010, SimuTools.

[9]  David J. Pym,et al.  Improving Security Policy Decisions with Models , 2015, IEEE Security & Privacy.

[10]  Brian F. Chellas Modal Logic: Normal systems of modal logic , 1980 .

[11]  Stefan Milius A Sound and Complete Calculus for Finite Stream Circuits , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[12]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[13]  Simon Shiu,et al.  Decision support for systems security investment , 2010, 2010 IEEE/IFIP Network Operations and Management Symposium Workshops.

[14]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

[15]  Alexandra Silva,et al.  Language Constructs for Non-Well-Founded Computation , 2013, ESOP.

[16]  J. Brotherston,et al.  Hennessy-Milner Completeness in Transition Systems with Synchronous Concurrent Composition 8 th December 2015 , 2015 .

[17]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[18]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[19]  Wojciech Jamroga A temporal logic for Markov chains , 2008, AAMAS.

[20]  Julian Williams,et al.  Compositional Security Modelling - Structure, Economics, and Behaviour , 2014, HCI.

[21]  David J. Pym,et al.  A logic of separating modalities , 2016, Theor. Comput. Sci..

[22]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[23]  Peter W. O'Hearn,et al.  Possible worlds and resources: the semantics of BI , 2004, Theor. Comput. Sci..

[24]  Peter W. O'Hearn,et al.  BI as an assertion language for mutable data structures , 2001, POPL '01.

[25]  David J. Pym,et al.  A Logical and Computational Theory of Located Resource , 2009, J. Log. Comput..

[26]  David J. Pym,et al.  A Discipline of Mathematical Systems Modelling , 2012 .

[27]  Matthew Hennessy,et al.  Compositional reasoning for weighted Markov decision processes , 2013, Sci. Comput. Program..

[28]  Dominique Larchey-Wendling,et al.  Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding , 2009, Math. Struct. Comput. Sci..

[29]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[30]  Gabrielle Anderson,et al.  A calculus and logic of bunched resources and processes , 2016, Theor. Comput. Sci..