Deciding Properties of Nonregular Programs
DOI10.1137/0222054zbMATH Open0789.03029OpenAlexW2115915222MaRDI QIDQ3137712FDOQ3137712
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
Recommendations
pushdown automatanonregular languagesdeterministic stack machinesextensions of propositional dynamic logic with nonregular programs
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)
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
- Title not available (Why is that?)
- Wreath products of distributive forest algebras
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
- Title not available (Why is that?)
- Propositional dynamic logic of nonregular programs
- Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
- Foundations of Software Science and Computation Structures
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)
