Proving Approximate Implementations for Probabilistic I/O Automata (Q2864525): Difference between revisions
From MaRDI portal
Latest revision as of 02:01, 20 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proving Approximate Implementations for Probabilistic I/O Automata |
scientific article |
Statements
Proving Approximate Implementations for Probabilistic I/O Automata (English)
0 references
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