Infinite behaviour of Petri nets (Q2265817): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(83)90115-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082483369 / rank | |||
Normal rank | |||
Revision as of 20:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinite behaviour of Petri nets |
scientific article |
Statements
Infinite behaviour of Petri nets (English)
0 references
1983
0 references
The paper describes the behaviour of Petri nets (place/transition nets with transition labelling) by classes of \(\omega\)-languages (of infinite words) and gives a complete list of inclusion properties between the different classes of languages.
0 references
Petri net
0 references
fairness
0 references
omega language
0 references
inclusion properties
0 references
classes of languages
0 references
