Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2005.03.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2005.03.002 / rank | |||
Normal rank | |||
Latest revision as of 15:36, 10 December 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
