Determinism and looping in combinatory PDL

DOI10.1016/0304-3975(88)90126-0MaRDI QIDQ921968zbMATH OpenOpenAlexFDO

Authors George K. Gargov, Solomon Passy

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

• scientific article; zbMATH DE number 3858391 (Why is no real title available?)
• scientific article; zbMATH DE number 3924749 (Why is no real title available?)
• scientific article; zbMATH DE number 3732007 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• An essay in combinatory dynamic logic
• Concurrent dynamic logic
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• Looping vs. repeating in dynamic logic
• More on looping vs. repeating in dynamic logic
• PDL with data constants
• Propositional dynamic logic of looping and converse is elementarily decidable
• Propositional dynamic logic of regular programs

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)