Journal of the ACM (JACM)
Communication in concurrent dynamic logic
Journal of Computer and System Sciences
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Modal and temporal properties of processes
Modal and temporal properties of processes
Communication and Concurrency
A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about protocol change and knowledge
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Propositional Dynamic Logic with Storing, Recovering and Parallel Composition
Electronic Notes in Theoretical Computer Science (ENTCS)
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Hi-index | 0.00 |
This work presents a Propositional Dynamic Logic in which the programs are CCS terms (CCS-PDL). Its goal is to reason about properties of concurrent systems specified in CCS. CCS is a process algebra that models the concurrency and interaction between processes through individual acts of communication. At a first step, we consider only CCS processes without constants and give a complete axiomatization for this logic, which is very similar to *-free PDL. Then, we proceed to include CCS processes with constants. In this case, we impose some restrictions on the form of the recursive equations that can be built with those constants. We also give an axiomatization for this second logic and prove its completeness using a Fischer-Ladner construction. Unlike Concurrent PDL (with channels) [1,2], our logic has a simple Kripke semantics, a complete axiomatization and the finite model property.