A spatial logic for concurrency. II

DOI10.1016/j.tcs.2003.10.041zbMath1050.68104OpenAlexW2073222985WikidataQ56982084 ScholiaQ56982084MaRDI QIDQ1881257

Luís Caires, Luca Cardelli

Publication date: 4 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.041

zbMATH Keywords

modal logicdistributed systemscut eliminationsequent calculusproof theory

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cut-elimination and normal-form theorems (03F05) Distributed systems (68M14)

Related Items (11)

A proof theoretic view of spatial and temporal dependencies in biochemical systems ⋮ A Logic for Distributed Higher Order π-Calculus ⋮ Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes ⋮ PHYSARUM SPATIAL LOGIC ⋮ Spatial-behavioral types for concurrency and resource control in distributed systems ⋮ Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Abstract interpretation based verification of temporal properties for BioAmbients ⋮ Spatial-Behavioral Types, Distributed Services, and Resources ⋮ Manipulating Trees with Hidden Labels ⋮ Co-Algebraic Models for Quantitative Spatial Logics

Uses Software

• SLMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spatial logic for concurrency. I
• Separability in the Ambient Logic
• Algebraic laws for nondeterminism and concurrency
• The Logic of Bunched Implications
• Anytime, anywhere
• Extensionality and intensionality of the ambient logics

This page was built for publication: A spatial logic for concurrency. II