Pages that link to "Item:Q3616354"
From MaRDI portal
The following pages link to PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354):
Displaying 14 items.
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Eliminating ``converse'' from converse PDL (Q1923830) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- Satisfiability for SCULPT-schemas for CSV-like data (Q3305360) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- PDL with intersection of programs: a complete axiomatization (Q3643256) (← links)
- Undecidability of representability as binary relations (Q4899169) (← links)
- (Q5009419) (← links)
- (Q5091278) (← links)
- 2-Exp Time lower bounds for propositional dynamic logics with intersection (Q5486241) (← links)