Formal language constrained reachability and model checking propositional dynamic logics

DOI10.1007/978-3-642-24288-5_6MaRDI QIDQ3172863zbMATH OpenOpenAlexFDO

Authors Roland Axelsson, Martin Lange

Publication date 7 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24288-5_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• Infinite State Model-Checking of Propositional Dynamic Logics
• Nodes connected by path languages
• Model checking propositional dynamic logic with all extras
• On the complexity of L-reachability
• On the complexity of L-reachability

Cited in

(5)

• Local higher-order fixpoint iteration
• Nodes connected by path languages
• scientific article; zbMATH DE number 7455743 (Why is no real title available?)
• Separating the expressive power of propositional dynamic and modal fixpoint logics
• Interconvertibility of a class of set constraints and context-free-language reachability

This page was built for publication: Formal language constrained reachability and model checking propositional dynamic logics

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