Looping vs. repeating in dynamic logic

DOI10.1016/S0019-9958(82)90553-8zbMath0541.68010OpenAlexW2041398371MaRDI QIDQ3327707

No author found.

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(82)90553-8

zbMATH Keywords

regular expressionsloopinfinite computationsrepeatrelative expressivenessextensions of propositional dynamic logic

Mathematics Subject Classification ID

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

Related Items (13)

While-programs with nondeterministic assignments and the logic ALNA ⋮ Automata-theoretic techniques for modal logics of programs ⋮ Dynamic logic with program specifications and its relational proof system ⋮ Branching-time logics and fairness, revisited ⋮ Determinism and looping in combinatory PDL ⋮ Determinism and non-determinism in PDL ⋮ Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations ⋮ More on looping vs. repeating in dynamic logic ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ 2-Exp Time lower bounds for propositional dynamic logics with intersection ⋮ Computation paths logic: An expressive, yet elementary, process logic ⋮ Computation paths logic: An expressive, yet elementary, process logic

This page was built for publication: Looping vs. repeating in dynamic logic