Probabilistic semantics for RoboChart. A weakest completion approach (Q2296286)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic semantics for RoboChart. A weakest completion approach |
scientific article; zbMATH DE number 7168635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic semantics for RoboChart. A weakest completion approach |
scientific article; zbMATH DE number 7168635 |
Statements
Probabilistic semantics for RoboChart. A weakest completion approach (English)
0 references
18 February 2020
0 references
RoboChart language
0 references
robotic controllers
0 references
statecharts
0 references
probabilistic semantics
0 references
relational calculus
0 references
Unifying Theories of Programming (UTP)
0 references
weakest completion semantics
0 references
0.7019428610801697
0 references
0.6913707852363586
0 references
0.6875575184822083
0 references
0.6866704821586609
0 references
