Edinburgh Research Explorer

ProPPA: Probabilistic Programming for Stochastic Dynamical Systems

Research output: Contribution to journalArticle

Related Edinburgh Organisations

Open Access permissions

Open

Documents

Original languageEnglish
Number of pages24
JournalACM Transactions on Modeling and Computer Simulation
Volume28
Issue number1
Early online dateJan 2018
StateE-pub ahead of print - Jan 2018

Abstract

Formal languages like process algebras have been shown to be effective tools in modelling a wide range of dynamic systems, providing a high-level description that is readily transformed into an executable model. However their application is sometimes hampered because the quantitative details of many real-world
systems of interest are not fully known. In contrast, in machine learning there has been work to develop probabilistic programming languages, which provide system descriptions that incorporate uncertainty and leverage advanced statistical techniques to infer unknown parameters from observed data. Unfortunately current probabilistic programming languages are typically too low-level to be suitable for complex modelling.
In this paper we present ProPPA, the first instance of the probabilistic programming paradigm being applied to a high-level, formal language, and its supporting tool suite. We explain the semantics of the language in terms of a quantitative generalisation of Constraint Markov Chains and describe the implementation of the language, discussing in some detail the different inference algorithms available, and their domain of applicability. We conclude by illustrating the use of the language on simple but non-trivial case studies: here
ProPPA is shown to combine the elegance and simplicity of high-level formal modelling languages with an effective way of incorporating data, making it a promising tool for modelling studies.

Download statistics

No data available

ID: 44197153