A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus

Authors:
Mario R. F. Benevides;L. Menasché Schechter
Affiliations:
Computer Science Department and Systems and Computer Engineering Program, Federal University of Rio de Janeiro, Brazil;Systems and Computer Engineering Program, Federal University of Rio de Janeiro, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 10
Cited 1

Concurrent dynamic logic

Journal of the ACM (JACM)
Communication in concurrent dynamic logic

Journal of Computer and System Sciences
Modal logics for mobile processes

Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I

Information and Computation
The complexity of PDL with interleaving

Theoretical Computer Science
Model checking mobile processes

Information and Computation
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Modal logic

Modal logic
Extensive Games as Process Models

Journal of Logic, Language and Information
A Propositional Dynamic Logic for CCS Programs

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation

Propositional Dynamic Logic with Storing, Recovering and Parallel Composition

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a Propositional Dynamic Logic (@pDL) in which the programs are described in a language based on the @p-Calculus without replication. Our goal is to build a dynamic logic that is suitable for the description and verification of properties of communicating concurrent systems, in a similar way as PDL is used for the sequential case. We build a simple Kripke semantics for this logic, provide a complete axiomatization for it and show that it has the finite model property.