Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Properties of Conflict-Free and Persistent Petri Nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The decidability of persistence for vector addition systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Persistence of vector replacement systems is decidable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4202931 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial algorithms for the synthesis of bounded nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Concurrent transition systems / rank | |||
Normal rank | |||
Revision as of 05:38, 2 July 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
