Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs (Q539486)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5900874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs |
scientific article; zbMATH DE number 5900874 |
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
0 references
0.9448018074035645
0 references
0.8310393691062927
0 references
0.8089172840118408
0 references
0.8046442270278931
0 references
