Deciding probabilistic automata weak bisimulation: theory and practice (Q282105)
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: Deciding probabilistic automata weak bisimulation: theory and practice |
scientific article; zbMATH DE number 6579512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding probabilistic automata weak bisimulation: theory and practice |
scientific article; zbMATH DE number 6579512 |
Statements
Deciding probabilistic automata weak bisimulation: theory and practice (English)
0 references
12 May 2016
0 references
complexity
0 references
compositional analysis
0 references
concurrency
0 references
efficiency
0 references
linear programming
0 references
probabilistic automata
0 references
satisfiability modulo theories
0 references
weak bisimulation
0 references
0 references
0 references
0 references
0.894153356552124
0 references
0.8733695149421692
0 references
0.8678042888641357
0 references
