An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (Q4633174): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3771633 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Free Choice Petri Nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reachability in cyclic extended free-choice systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3999014 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Latest revision as of 02:38, 19 July 2024
scientific article; zbMATH DE number 7049856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular |
scientific article; zbMATH DE number 7049856 |
Statements
An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (English)
0 references
2 May 2019
0 references
expressive power
0 references
minimal cover
0 references
cluster graph
0 references
output place
0 references
rank theorem
0 references
