scientific article; zbMATH DE number 3862425

MaRDI QIDQ3330494zbMATH OpenFDO

Authors Tmima Koren, Amir Pnueli

Publication date 1984

zbMATH Keywords

context-free languagespropositional dynamic logicsregular languages

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)

Recommendations

• Propositional dynamic logic of nonregular programs
• Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
• Deciding Properties of Nonregular Programs
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 7317262

Cited in

(12)

• Problems concerning fairness and temporal logic for conflict-free Petri nets
• Propositional dynamic logic with recursive programs
• Deciding Properties of Nonregular Programs
• Regular dynamic logic is not interpretable in deterministic context-free dynamic logic
• scientific article; zbMATH DE number 7317262 (Why is no real title available?)
• scientific article; zbMATH DE number 7713505 (Why is no real title available?)
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Propositional dynamic logic of nonregular programs
• Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
• Propositional dynamic logic of context-free programs and fixpoint logic with chop
• A note on an extension of PDL

This page was built for publication:

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