Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets |
scientific article |
Statements
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (English)
0 references
4 December 2009
0 references
Petri net
0 references
bounded
0 references
persistent
0 references
concurrency
0 references
minimal automaton
0 references
