Deciding Properties of Nonregular Programs

DOI10.1137/0222054zbMath0789.03029OpenAlexW2115915222MaRDI QIDQ3137712

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) Logic in computer science (03B70) 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)

Related Items (7)

Bisimilar and logically equivalent programs in PDL with parallel operator ⋮ Bisimilar and logically equivalent programs in PDL ⋮ Propositional Dynamic Logic for Petri Nets with Iteration ⋮ Propositional dynamic logic with recursive programs ⋮ On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic ⋮ Propositional Dynamic Logic with Program Quantifiers ⋮ Towards reasoning about Petri nets: a propositional dynamic logic based approach

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