4164 search results - page 57 / 833 » Timing model reduction for hierarchical timing analysis |
CHARME
2001
Springer
14 years 1 months ago
2001
Springer
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
WALCOM
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
AIIDE
2008
13 years 11 months ago
2008
Petri Nets can be used for a retrospective analysis of a computer game story, for representing plots in serious games as well as for monitoring the course of the story, as recentl...
IJCNN
2000
IEEE
14 years 1 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
DASFAA
2008
IEEE
14 years 3 months ago
2008
IEEE
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...