More on looping vs. repeating in dynamic logic

DOI10.1016/0020-0190(85)90069-9zbMath0559.68049OpenAlexW2016724360MaRDI QIDQ2265813

David Peleg, David Harel

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90069-9

zbMATH Keywords

loopdynamic logicprogram verificationinfinite computationsrepeatvalidity problemshigh undecidability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (3)

Determinism and looping in combinatory PDL ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL

Cites Work

• Unnamed Item
• Definability in dynamic logic
• Expressing program looping in regular dynamic logic
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Looping vs. repeating in dynamic logic

This page was built for publication: More on looping vs. repeating in dynamic logic