A substructural logic for layered graphs

Complex systems, be they natural or synthetic, are ubiquitous. In particular, complex networks of devices and services underpin most of society's operations. By their very nature, such systems are difficult to conceptualize and reason about effectively. The concept of layering is widespread in complex systems, but has not been considered conceptually. Noting that graphs are a key formalism in the description of complex systems, we establish a notion of a layered graph. We provide a logical characterization of this notion of layering using a non-associative, non-commutative substructural, separating logic. We provide soundness and completeness results for a class of algebraic models that includes layered graphs, which give a mathematically substantial semantics to this very weak logic. We explain, via examples, applications in information processing and security.

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

[2]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[3]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[4]  Alan Weir,et al.  Relevant Logic: A Philosophical Examination of Inference , 1990 .

[5]  Gavin M. Bierman.  What is a Categorical Model of Intuitionistic Linear Logic? , 1995, TLCA.

[6]  Katarzyna Musial,et al.  A degree centrality in multi-layered social network , 2011, 2011 International Conference on Computational Aspects of Social Networks (CASoN).

[7]  Nuel D. Belnap,et al.  Entailment : the logic of relevance and necessity , 1975 .

[8]  J. Lambek.  Deductive systems and categories II. Standard constructions and closed categories , 1969 .

[9]  David J. Pym,et al.  On bunched predicate logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[10]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

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

[12]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

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

[14]  Nuel Belnap,et al.  Display logic , 1982, J. Philos. Log..

[15]  Joachim Lambek,et al.  Deductive systems and categories III. Cartesian closed categories, intuitionist propositional calculus, and combinatory logic , 1972 .

[16]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

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

[18]  Anuj Dawar,et al.  Expressiveness and complexity of graph logic , 2007, Inf. Comput..

[19]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[20]  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.

[21]  Sundar Vishwanathan,et al.  Competitive Algorithms for Layered Graph Traversal , 1998, SIAM J. Comput..

[22]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[23]  Juan Wang,et al.  Topological analysis of a two coupled evolving networks model for business systems , 2009, Expert Syst. Appl..

[24]  Azaria Paz,et al.  A theory of decomposition into prime factors of layered interconnection networks , 2011, Discret. Appl. Math..

[25]  N. Belnap,et al.  Entailment. The Logic of Relevance and Necessity. Volume I , 1978 .

[26]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[27]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[28]  Alexandra Silva,et al.  Non-Deterministic Kleene Coalgebras , 2010, Log. Methods Comput. Sci..

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

[30]  James Brotherston,et al.  Classical BI: Its Semantics and Proof Theory , 2010, Log. Methods Comput. Sci..

[31]  Ken Binmore,et al.  Playing for Real , 2007 .

[32]  Joachim Lambek.  Deductive systems and categories , 2005, Mathematical systems theory.

[33]  Greg Restall,et al.  An Introduction to Substructural Logics , 2000 .

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

[35]  James Brotherston,et al.  Bunched Logics Displayed , 2012, Studia Logica.

[36]  Kosta Dosen.  Sequent-systems and groupoid models. II , 1989, Stud Logica.

[37]  David J. Pym,et al.  The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[38]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

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

[40]  Luís Gouveia,et al.  Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..

[41]  Patrick Thiran,et al.  Layered complex networks. , 2006, Physical review letters.

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

[43]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[44]  D. Prawitz.  Natural Deduction: A Proof-Theoretical Study , 1965 .

[45]  Kosta Dosen,et al.  Sequent-systems and groupoid models. I , 1988, Stud Logica.

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

[47]  Dushyant Sharma,et al.  Modeling and solving the rooted distance-constrained minimum spanning tree problem , 2008, Comput. Oper. Res..