Pages that link to "Item:Q3616217"
From MaRDI portal
The following pages link to Complexity of propositional projection temporal logic with star (Q3616217):
Displaying 11 items.
- A cylinder computation model for many-core parallel computing (Q391222) (← links)
- A novel algorithm for intrusion detection based on RASL model checking (Q474447) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic (Q896152) (← links)
- A note on stutter-invariant PLTL (Q989448) (← links)
- A temporal programming model with atomic blocks based on projection temporal logic (Q1633057) (← links)
- Verify heaps via unified model checking (Q1986561) (← links)
- Efficient decision procedure for propositional projection temporal logic (Q2197530) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
- Expressiveness of propositional projection temporal logic with star (Q2430015) (← links)
- Verifying safety critical task scheduling systems in PPTL axiom system (Q5963639) (← links)
