Propositional dynamic logic with recursive programs

DOI10.1016/J.JLAP.2006.11.003MaRDI QIDQ2643333zbMATH OpenOpenAlexFDO

Authors Christof Löding, Carsten Lutz, Olivier Serre

Publication date 23 August 2007

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2006.11.003

zbMATH Keywords

propositional dynamic logicvisibly pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• Foundations of Software Science and Computation Structures
• The propositional dynamic logic of deterministic, well-structured programs
• scientific article; zbMATH DE number 139632
• Deciding Properties of Nonregular Programs
• Propositional dynamic logic of nonregular programs

Cites work

• scientific article; zbMATH DE number 3862425 (Why is no real title available?)
• scientific article; zbMATH DE number 3880483 (Why is no real title available?)
• scientific article; zbMATH DE number 1032009 (Why is no real title available?)
• scientific article; zbMATH DE number 1142324 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A fixpoint calculus for local and global program flows
• Alternation
• Automata-theoretic techniques for modal logics of programs
• Deciding Properties of Nonregular Programs
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Finiteness is mu-ineffable
• Languages of Nested Trees
• More on nonregular PDL: Finite models and Fibonacci-like programs
• Parenthesis Grammars
• Propositional dynamic logic of looping and converse is elementarily decidable
• Propositional dynamic logic of nonregular programs
• Propositional dynamic logic of regular programs
• Tools and Algorithms for the Construction and Analysis of Systems
• Visibly pushdown languages

Cited in

(35)

• Visibly linear dynamic logic
• scientific article; zbMATH DE number 139632 (Why is no real title available?)
• Visibly linear dynamic logic
• Automated Reasoning
• scientific article; zbMATH DE number 3968565 (Why is no real title available?)
• scientific article; zbMATH DE number 4174903 (Why is no real title available?)
• Reasoning with recursive loops under the PLP framework
• scientific article; zbMATH DE number 4068839 (Why is no real title available?)
• scientific article; zbMATH DE number 3880104 (Why is no real title available?)
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
• Temporal logic with recursion
• PDL with negation of atomic programs
• Beyond regularity for Presburger modal logics
• PDL with data constants
• Separating the expressive power of propositional dynamic and modal fixpoint logics
• Foundations of Software Science and Computation Structures
• Propositional dynamic logic for Petri nets with iteration
• scientific article; zbMATH DE number 1678389 (Why is no real title available?)
• Propositional dynamic logic of nonregular programs
• Temporal Logic with Recursion.
• Temporal logics with language parameters
• Decision complexity of variants of propositional dynamic logic
• Propositional dynamic logic with program quantifiers
• Branching-time logics with path relativisation
• scientific article; zbMATH DE number 3848600 (Why is no real title available?)
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Temporal logics with language parameters
• Bisimilar and logically equivalent programs in PDL with parallel operator
• Propositional dynamic logic of context-free programs and fixpoint logic with chop
• Propositional dynamic logic for higher-order functional programs
• Well-structured program equivalence is highly undecidable
• Towards reasoning about Petri nets: a propositional dynamic logic based approach
• The propositional dynamic logic of deterministic, well-structured programs
• A note on an extension of PDL
• Deciding Properties of Nonregular Programs

This page was built for publication: Propositional dynamic logic with recursive programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643333)