2 research outputs found
Dynamic Epistemic Logic with Communication Actions
This work proposes a Dynamic Epistemic Logic with Communication Actions that
can be performed concurrently. Unlike Concurrent Epistemic Action Logic
introduced by Ditmarsch, Hoek and Kooi, where the concurrency mechanism is the
so called true concurrency, here we use an approach based on process calculus,
like CCS and CSP, and Action Models Logic. Our approach makes possible the
proof of soundness, completeness and decidability, different from the others
approaches. We present an axiomatization and show that the proof of soundness,
completeness and decidability can be done using a reduction method
CCS-Based Dynamic Logics for Communicating Concurrent Programs
This work presents three increasingly expressive Dynamic Logics in which the
programs are CCS processes (sCCS-PDL, CCS-PDL and XCCS-PDL). Their goal is to
reason about properties of concurrent programs and systems described using CCS.
In order to accomplish that, CCS's operators and constructions are added to a
basic modal logic in order to create dynamic logics that are suitable for the
description and verification of properties of communicating, concurrent and
non-deterministic programs and systems, in a similar way as PDL is used for the
sequential case. We provide complete axiomatizations for the three logics.
Unlike Peleg's Concurrent PDL with Channels, our logics have a simple Kripke
semantics, complete axiomatizations and the finite model property.Comment: 28 page