Deciding Properties of Nonregular Programs

DOI10.1137/0222054MaRDI QIDQ3137712zbMATH OpenOpenAlexFDO

Authors David Harel, Danny Raz

Publication date 10 October 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222054

zbMATH Keywords

pushdown automatanonregular languagesdeterministic stack machinesextensions of propositional dynamic logic with nonregular programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

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

Cited in

(16)

• A note on an extension of PDL
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Bisimilar and logically equivalent programs in PDL
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• Bisimilar and logically equivalent programs in PDL with parallel operator
• Propositional dynamic logic with program quantifiers
• Propositional dynamic logic with recursive programs
• Propositional dynamic logic for Petri nets with iteration
• Towards reasoning about Petri nets: a propositional dynamic logic based approach
• scientific article; zbMATH DE number 3862425 (Why is no real title available?)
• Wreath products of distributive forest algebras
• Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
• Propositional dynamic logic of nonregular programs
• scientific article; zbMATH DE number 3983144 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features

This page was built for publication: Deciding Properties of Nonregular Programs

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