Chrome Extension
WeChat Mini Program
Use on ChatGLM

An Axiomatisation of the Probabilistic -Calculus

Formal Methods and Software Engineering: 21st International Conference on Formal Engineering Methods, ICFEM 2019, Shenzhen, China, November 5–9, 2019, Proceedings(2019)

Cited 0|Views0
No score
Abstract
The probabilistic -calculus (PTL) is a simple and succinct probabilistic extension of the propositional -calculus, by extending the ‘next’-operator with a probabilistic quantifier. We extend the approach developed by Walukiewicz for propositional -calculus and provide an axiomatisation of PTL. Our main contributions are a sound axiom system for PTL, and a proof of its completeness for aconjunctive formulae.
More
Translated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined