2000 character limit reached
A Probabilistic Variant of Projection Temporal Logic
Published 7 Jan 2011 in cs.LO | (1101.1379v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.