Infinite State Model-Checking of Propositional Dynamic Logics
From MaRDI portal
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
- Propositional dynamic logic with fixed points: algorithmic tools for verification of finite state machines
Cited in
(12)- Infinite-state invariant checking with IC3 and predicate abstraction
- Model checking propositional dynamic logic with all extras
- Propositional dynamic logic with fixed points: algorithmic tools for verification of finite state machines
- 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
- Infinitary domain logic for finitary transition systems
- 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)