Rechercher

[BB08] Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs

Conférence Internationale avec comité de lecture : FORMATS'08, 6th International Conference on Formal Modeling and Analysis of Timed Systems, Saint-Malo, France, January 2008, Vol. 5215, pp.265-279, Series LNCS ,
motcle:
Résumé: We consider here time Petri nets (the TPN model) and two of its state space abstractions: the state class graph (SCG) and the zone based graph (ZBG). We show that only some time points of the clock/firing domains of abstract states are relevant to construct a TPN reachability graph. Moreover, for the state class graph method, the graph computed using relevant time points is smaller than the SCG. Fulltext Preview

For further information, please visit this web site.

BibTeX

@inproceedings {
BB08,
title="{Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs}",
author=" H. Boucheneb and K. Barkaoui ",
booktitle="{FORMATS'08, 6th International Conference on Formal Modeling and Analysis of Timed Systems, Saint-Malo, France}",
year=2008,
month="January",
series="LNCS ",
volume=5215,
pages="265-279",
}