Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs (Q539486): 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.1007/s10626-011-0100-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969752454 / rank | |||
Normal rank | |||
Revision as of 01:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs |
scientific article |
Statements
Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs (English)
0 references
30 May 2011
0 references
The authors consider Petri nets (the TPN model). Their main result is the following: ``Only some timed schedules/clock vectors (one per enabled transition) of the clock/firing domains are relevant to construct reachability graphs for the TPN''. Resulting graphs are smaller then reachability graphs proposed in literature before. The article contains some illustrative examples.
0 references
Petri nets
0 references
TPN model
0 references
reachability graphs
0 references
