Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs

Autor:	Hanifa Boucheneb, Kamel Barkaoui
Rok vydání:	2011
Předmět:	Discrete mathematics Relation (database) Discrete time and continuous time Control and Systems Engineering Reachability Computer science Modeling and Simulation Stochastic Petri net State space Constraint graph (layout) Construct (python library) Electrical and Electronic Engineering Petri net
Zdroj:	Discrete Event Dynamic Systems. 21:171-204
ISSN:	1573-7594 0924-6703
DOI:	10.1007/s10626-011-0100-4
Popis:	We consider here the time Petri nets (the TPN model) and its state space abstractions. We show that only some timed schedules/clock vectors (one per enabled transition) of the clock/firing domains are relevant to construct reachability graphs for the TPN. Moreover, we prove formally that the resulting graphs are smaller than the TPN reachability graphs proposed in the literature. Furthermore, these results establish a relation between dense time and discrete time analysis of time Petri nets and allow also improving discrete time analysis by considering only some elements of the clock/firing domains.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ffa32edbd744eb6833ca6f4445ee6b9c https://doi.org/10.1007/s10626-011-0100-4 Zobrazit plný text záznamu Full text from SpringerLink