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

DOI10.1016/j.entcs.2010.04.005zbMath1345.68228OpenAlexW2062238968MaRDI QIDQ3185762

Mario R. F. Benevides, L. Menasché Schechter

Publication date: 5 August 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.04.005

zbMATH Keywords

completenessdynamic logicKripke semanticsconcurrencyaxiomatization

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A dynamic logic with branching modalities, Propositional dynamic logic for searching games with errors, Propositional Dynamic Logic with Storing, Recovering and Parallel Composition, Dynamic epistemic logic with communication actions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for mobile processes
• Modelling simultaneous games in dynamic logic
• Communication in concurrent dynamic logic
• A calculus of mobile processes. II
• Propositional dynamic logic of regular programs
• The complexity of PDL with interleaving
• Extensive games as process models
• Model checking mobile processes
• Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator
• A Propositional Dynamic Logic for CCS Programs
• Concurrent dynamic logic
• Derivatives of Regular Expressions