A Probabilistic Variant of Projection Temporal Logic
classification
💻 cs.LO
keywords
logicprptlformprobabilisticprojectiontemporalformulasnormal
read the original abstract
In this paper, we propose Probabilistic discrete-time Projection Temporal Logic (PrPTL), which extends Projection Temporal Logic (PTL) with probability. To this end, some useful formulas are derived and some logic laws are given. Further, we define Time Normal Form (TNF) for PrPTL as the standard form and prove that any PrPTL formulas can be rewritten to TNF. According to the TNF, we construct the time normal form graph which can be used for the probabilistic model checking on PrPTL.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.