Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond |
scientific article |
Statements
Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (English)
0 references
14 June 2021
0 references
weighted Petri net
0 references
weighted marked graph
0 references
choice-free net
0 references
synthesis
0 references
weak synthesis
0 references
labelled transition system
0 references
cycle
0 references
cyclic word
0 references
circular solvability
0 references
polynomial-time algorithm
0 references
P-vector
0 references
T-vector
0 references
Parikh vector
0 references
0 references
0 references
0 references
