Branching automata with costs -- a way of reflecting parallelism in costs (Q703495)
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: Branching automata with costs -- a way of reflecting parallelism in costs |
scientific article; zbMATH DE number 2126084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branching automata with costs -- a way of reflecting parallelism in costs |
scientific article; zbMATH DE number 2126084 |
Statements
Branching automata with costs -- a way of reflecting parallelism in costs (English)
0 references
11 January 2005
0 references
Concurrency
0 references
Weighted automata
0 references
sp-posets
0 references
Formal power series
0 references
Bisemiring
0 references
0 references
0.9999995
0 references
0 references
0.84854436
0 references
0.8445402
0 references
0.8407172
0 references
0 references
0.8365988
0 references
