Augmenting branching temporal logics with existential quantification over atomic propositions

DOI10.1093/logcom/9.2.135zbMath0942.68072MaRDI QIDQ4242583

Orna Kupferman

Publication date: 20 June 1999

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/9.2.135

zbMATH Keywords

complexity; model checking; branching temporal logics; program complexity

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

03B44: Temporal logic