Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets |
scientific article; zbMATH DE number 5642347
| 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; zbMATH DE number 5642347 |
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
