Decidability of Modular Logics for Concurrency

The modular logics we approach in this paper are logics for concurrent systems that reflect both behavioral and structural properties of systems. They combine dynamic modalities that express behavioural properties of a system with polyadic modalities that join properties of subsystems. Spatial and Separation Logics are examples of modular logics. Being the complex algebraic-coalgebraic semantics, these logics have interesting decidability properties. In this paper we provide a taxonomy of the decision problems for a class of modular logics with semantics based on CCS processes.

[1]  David J. Israel.  Language in action: Categories, lambdas and dynamic logic Johan van Benthem , 1993 .

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

[3]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

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

[5]  Luca Cardelli,et al.  The Measurable Space of Stochastic Processes , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[6]  Kim G. Larsen,et al.  Modular Markovian Logic , 2011, ICALP.

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

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

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

[10]  Kim G. Larsen,et al.  Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas , 2011, CSL.

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

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

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

[14]  Luca Cardelli,et al.  Deciding validity in a spatial logic for trees , 2003, TLDI '03.

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

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

[17]  Alberto Policriti,et al.  A Complete Axiomatic System for a Process-Based Spatial Logic , 2008, MFCS.

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

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

[20]  Corrado Priami,et al.  Dynamic-Epistemic Spatial Logic , 2006 .

[21]  R. Mardare,et al.  A Propositional Branching Temporal Logic for the Ambient Calculus , 2003 .

[22]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[23]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[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]  Luís Caires,et al.  Elimination of quantifiers and undecidability in spatial logics for concurrency , 2006, Theor. Comput. Sci..

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

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

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

[31]  Mads Dam,et al.  Model Checking Mobile Processes , 1993, Inf. Comput..

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

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

[34]  Corrado Priami,et al.  A Logical Approach to Security in the Context of Ambient Calculus , 2004, Electron. Notes Theor. Comput. Sci..