A Complete Axiomatic System for a Process-Based Spatial Logic

The process-based Spatial Logics are multi-modal logics developed for semantics on Process Algebras and designed to specify concurrent properties of dynamic systems. On the syntactic level, they combine modal operators similar to operators of Hennessy-Milner logic, dynamic logic, arrow logic, relevant logic, or linear logic. This combination generates expressive logics, sometimes undecidable, for which a wide range of applications have been proposed. In the literature, there exist some sound proof systems for spatial logics, but the problem of completeness against process-algebraic semantics is still open. The main goal of this paper is to identify a sound-complete axiomatization for such a logic. We focus on a particular spatial logic that combines the basic spatial operators with dynamic and classical operators. The semantics is based on a fragment of CCS calculus that embodies the core features of concurrent behaviors. We prove the logic decidable both for satisfiability/validity and mode-checking, and we propose a sound-complete Hilbert-style axiomatic system for it.

[1]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[2]  Davide Sangiorgi,et al.  Extensionality and intensionality of the ambient logics , 2001, POPL '01.

[3]  Johan van Benthem,et al.  Language in action , 1991, J. Philos. Log..

[4]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[5]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[6]  Witold Charatonik,et al.  The Decidability of Model Checking Mobile Ambients , 2001, CSL.

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

[8]  Alberto Policriti,et al.  Towards a Complete Axiomatization for Spatial Logic , 2008 .

[9]  Alexander Kurz,et al.  Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings , 2009, CALCO.

[10]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

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

[12]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[13]  Mads Dam Model Checking Mobile Processes , 1993, CONCUR.

[14]  J.F.A.K. van Benthem,et al.  Language in Action: Categories, Lambdas and Dynamic Logic , 1997 .

[15]  Corrado Priami,et al.  Decidable Extensions of Hennessy-Milner Logic , 2006, FORTE.

[16]  Radu Mardare,et al.  Observing Distributed Computation. A Dynamic-Epistemic Approach , 2007, CALCO.

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

[18]  Viktor Gyuris Associativity does not imply undecidability without the axiom of modal distribution , 1997 .

[19]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[20]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[21]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[22]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, CONCUR.

[23]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[24]  Alasdair Urquhart,et al.  Semantics for relevant logics , 1972, Journal of Symbolic Logic.

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

[26]  Peter W. O'Hearn,et al.  Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.

[27]  Luca Cardelli,et al.  Deciding validity in a spatial logic for trees , 2005, J. Funct. Program..

[28]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[29]  Luís Caires,et al.  Elimination of quantifiers and undecidability in spatial logics for concurrency , 2006, Theor. Comput. Sci..

[30]  D. Holdstock Past, present--and future? , 2005, Medicine, conflict, and survival.

[31]  Ramesh Hariharan,et al.  FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science , 2001, Lecture Notes in Computer Science.