On the expressiveness and complexity of randomization in finite state monitors (Q3452222)
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: On the expressiveness and complexity of randomization in finite state monitors |
scientific article; zbMATH DE number 6507204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the expressiveness and complexity of randomization in finite state monitors |
scientific article; zbMATH DE number 6507204 |
Statements
On the expressiveness and complexity of randomization in finite state monitors (English)
0 references
11 November 2015
0 references
omega automata
0 references
probabilistic automata
0 references
randomization
0 references
runtime verification
0 references
topology
0 references
0.7737230658531189
0 references
0.7633023262023926
0 references
0.7500243186950684
0 references
0.7435095310211182
0 references
0.7407307028770447
0 references
