The process-based Spatial Logics are multi-modal logics developed for semantics oil Process Algebras and designed to specify concurrent properties of dynamic systems. Oil 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.
A complete axiomatic system for a process-based spatial logic
POLICRITI, Alberto
2008-01-01
Abstract
The process-based Spatial Logics are multi-modal logics developed for semantics oil Process Algebras and designed to specify concurrent properties of dynamic systems. Oil 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.File | Dimensione | Formato | |
---|---|---|---|
TR-21-2008.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
282.8 kB
Formato
Adobe PDF
|
282.8 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.