Infinite State Model-Checking of Propositional Dynamic Logics

DOI10.1007/11874683_23MaRDI QIDQ3613348zbMATH OpenOpenAlexFDO

Authors Stefan Göller, Markus Lohrey

Publication date 12 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL http://elib.uni-stuttgart.de/handle/11682/2588

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• PDL with intersection and converse: satisfiability and infinite-state model checking
• scientific article; zbMATH DE number 5599076
• scientific article; zbMATH DE number 1263840
• Model checking propositional dynamic logic with all extras
• scientific article; zbMATH DE number 1678389

Cited in

(12)

• Infinite-state invariant checking with IC3 and predicate abstraction
• Model checking propositional dynamic logic with all extras
• scientific article; zbMATH DE number 1678389 (Why is no real title available?)
• Extending propositional dynamic logic for Petri nets
• Verifying Properties of Infinite Sequences of Description Logic Actions
• Formal language constrained reachability and model checking propositional dynamic logics
• PDL with intersection and converse: satisfiability and infinite-state model checking
• Connectivity games over dynamic networks
• scientific article; zbMATH DE number 1088041 (Why is no real title available?)
• A calculus for automatic verification of Petri nets based on resolution and dynamic logics
• Propositional dynamic logic with converse and repeat for message-passing systems
• Propositional dynamic logic with converse and repeat for message-passing systems

This page was built for publication: Infinite State Model-Checking of Propositional Dynamic Logics

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