Determinism and looping in combinatory PDL

DOI10.1016/0304-3975(88)90126-0zbMATH Open0709.68581OpenAlexW2025500813MaRDI QIDQ921968FDOQ921968

Solomon Passy, George K. Gargov

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90126-0

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Propositional dynamic logic of regular programs
• Title not available (Why is that?)
• Propositional dynamic logic of looping and converse is elementarily decidable
• Concurrent dynamic logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• An essay in combinatory dynamic logic
• Title not available (Why is that?)
• PDL with data constants
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• More on looping vs. repeating in dynamic logic
• Looping vs. repeating in dynamic logic

Cited In (5)

• An essay in combinatory dynamic logic
• A modal perspective on the computational complexity of attribute value grammar
• A modal logic for cyclic repeating
• Modal logic with names
• On the undecidability of logics with converse, nominals, recursion and counting

This page was built for publication: Determinism and looping in combinatory PDL

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