Probabilistic semantics for RoboChart. A weakest completion approach

DOI10.1007/978-3-030-31038-7_5OpenAlexW2973326731MaRDI QIDQ2296286

Alexandre Mota, Kangfeng Ye, Ana Cavalcanti, Simon Foster, J. C. P. Woodcock

Publication date: 18 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-31038-7_5

zbMATH Keywords

relational calculusprobabilistic semanticsstatechartsrobotic controllersRoboChart languageUnifying Theories of Programming (UTP)weakest completion semantics

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

A Unary Semigroup Trace Algebra ⋮ Formally verified animation for RoboChart using interaction trees ⋮ Automated reasoning for probabilistic sequential programs with theorem proving

This page was built for publication: Probabilistic semantics for RoboChart. A weakest completion approach