Open AccessProceedings Article
Definability and computability for PRSPDL
Philippe Balbiani,Tinko Tinchev +1 more
- pp 16-33
TLDR
This paper devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computabilityissue ofPRSPDL-validity for various fragments of the PRSP DL-language and for various classes of PR SPDL-frames.Abstract:
PRSPDL is a variant of PDL with parallel composition. In the Kripke models in which PRSPDL-formulas are evaluated, states have an internal structure. We devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computability issue of PRSPDL-validity for various fragments of the PRSPDL-language and for various classes of PRSPDL-frames.read more
Citations
More filters
Proceedings Article
DAL: A Logic for Data Analysis.
TL;DR: In this article, a logic language for expressing data analysis problems and a deductive system for the language to use proof procedures to obtain solutions to these problems are presented, which is similar to our approach.
Journal Article
Expressivity properties of boolean BI through relational models
TL;DR: This paper shows that BBI includes some S4-like modalities and deduce new results: faithful embeddings of S4 modal logic, and then of intuition-istic logic (IL) into BBI, despite of the classical nature of its additive connectives.
Journal ArticleDOI
Complexity and expressivity of propositional dynamic logics with finitely many variables
TL;DR: The complexity of satisfiability for finite-variable fragments of propositional dynamic logics is investigated, and it is shown that for all the logics the authors consider, such fragments are as semantically expressive as entire logics.
Journal ArticleDOI
Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization
Philippe Balbiani,Joseph Boudou +1 more
TL;DR: This paper adds an unorthodox rule of proof that makes the canonical model standard for the program operation of parallel composition in the language of PDL enlarged with propositional quantifiers and uses large programs for the proof of the Truth Lemma.
References
More filters
Proceedings ArticleDOI
Separation logic: a logic for shared mutable data structures
TL;DR: An extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure is developed, including extensions that permit unrestricted address arithmetic, dynamically allocated arrays, and recursive procedures.
Book
Dynamic Logic
TL;DR: This book provides the first comprehensive introduction to Dynamic Logic, a system of remarkable unity that is theoretically rich as well as of practical value.
Journal ArticleDOI
Propositional dynamic logic of regular programs
TL;DR: A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c.