LTL Property Verification on Grid-world environment
100PRISM Satisfaction ProbabilityTheorem 2 reward design
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Theorem 2 reward designSpecification=F b, DSA states=2, Streett pairs=1, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=F b ∧ G ¬h, DSA states=3, Streett pairs=1, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=FG e ∧ G ¬h, DSA states=3, Streett pairs=2, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=GF b, DSA states=2, Streett pairs=1, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=GF a ∧ GF b ∧ G ¬h, DSA states=6, Streett pairs=1, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=GF (a ∨ b) → FG ¬e, DSA states=7, Streett pairs=2, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=F (c ∧ F (d ∧ GF a ∧ GF b)) ∧ G ¬h, DSA states=6, Streett pairs=1, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=GF a → GF (b ∨ c), DSA states=3, Streett pairs=1, Policy type=Satisfying2026.05 | 100 | — | |
| Theorem 2 reward designSpecification=GF a ∧ GF b ∧ G ¬h, DSA states=6, Streett pairs=1, Policy type=Non-satisfying2026.05 | 83.33 | — | |
| Theorem 2 reward designSpecification=F b ∧ G ¬h, DSA states=3, Streett pairs=1, Policy type=Non-satisfying2026.05 | 45.32 | — | |
| Theorem 2 reward designSpecification=GF b, DSA states=2, Streett pairs=1, Policy type=Non-satisfying2026.05 | 21.69 | — | |
| Theorem 2 reward designSpecification=F b, DSA states=2, Streett pairs=1, Policy type=Non-satisfying2026.05 | 17.6 | — | |
| Theorem 2 reward designSpecification=FG e ∧ G ¬h, DSA states=3, Streett pairs=2, Policy type=Non-satisfying2026.05 | 10.51 | — | |
| Theorem 2 reward designSpecification=F (c ∧ F (d ∧ GF a ∧ GF b)) ∧ G ¬h, DSA states=6, Streett pairs=1, Policy type=Non-satisfying2026.05 | 7.71 | — | |
| Theorem 2 reward designSpecification=GF a → GF (b ∨ c), DSA states=3, Streett pairs=1, Policy type=Non-satisfying2026.05 | 7.39 | — | |
| Theorem 2 reward designSpecification=GF (a ∨ b) → FG ¬e, DSA states=7, Streett pairs=2, Policy type=Non-satisfying2026.05 | 2.07 | — |