Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics release_3h6ab7z4vfdvlbvuiakseon2h4

by Eric Alsmann

Released as a article .

2021  

Abstract

We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynamic logic (PDL), and those extending the modal mu-calculus. This is inspired by the recent discovery of a decidable program logic called Visibly Pushdown Fixpoint Logic with Chop which extends both the modal mu-calculus and PDL over visibly pushdown languages, which, so far, constituted the ends of two pillars of decidable program logics. Here we show that this logic is not only more expressive than either of its two fragments, but in fact even more expressive than their union. Hence, the decidability border amongst program logics has been properly pushed up. We complete the picture by providing results separating all the PDL-based and modal fixpoint logics with regular, visibly pushdown and arbitrary context-free constructions.
In text/plain format

Archived Files and Locations

application/pdf  211.1 kB
file_tt2prurjwzedzpp4bs26m2ufwi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-08-24
Version   v1
Language   en ?
arXiv  2108.10490v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f2b66021-83d2-47b5-b235-174131a7a927
API URL: JSON