The authors introduce PriTL, an algorithm that infers concise PLTL formulas separating positive from negative Markov chains, with soundness proofs and demonstrations on RL policies and protocol variants.
Learning branching-time properties in CTL and ATL via constraint solving
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
The authors introduce PriTL, an algorithm that infers concise PLTL formulas separating positive from negative Markov chains, with soundness proofs and demonstrations on RL policies and protocol variants.