Proving approximate implementations for probabilistic I/O automata (Q2864525)
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: Proving approximate implementations for probabilistic I/O automata |
scientific article; zbMATH DE number 6236522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proving approximate implementations for probabilistic I/O automata |
scientific article; zbMATH DE number 6236522 |
Statements
6 December 2013
0 references
approximate implementation
0 references
equivalence
0 references
approximate simulation
0 references
abstraction
0 references
probabilistic I/O automata
0 references
Proving approximate implementations for probabilistic I/O automata (English)
0 references
0.7887744903564453
0 references
0.7620207667350769
0 references
0.7574922442436218
0 references
0.742395281791687
0 references
0.7315767407417297
0 references
