Branching automata with costs -- a way of reflecting parallelism in costs (Q703495): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2004.07.005 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2004.07.005 / rank | |||
Normal rank |
Latest revision as of 01:10, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Branching automata with costs -- a way of reflecting parallelism in costs |
scientific article |
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