Decidability of Propositional Projection Temporal Logic with Infinite Models

DOI10.1007/978-3-540-72504-6_47zbMATH Open1198.68167OpenAlexW2146715343MaRDI QIDQ5425464

Cong Tian, Zhenhua Duan

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_47

zbMATH Keywords

decidabilitymodel checkingsatisfiabilityinterval temporal logicinfinite model

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (2)

A decision procedure for propositional projection temporal logic with infinite models ⋮ Complexity of propositional projection temporal logic with star

This page was built for publication: Decidability of Propositional Projection Temporal Logic with Infinite Models

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