.png){kind=icon}
返回
Efficient Reachability Analysis for Time Petri Nets
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2010.195.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose in this paper some efficient approaches, based on the state class graph method, to construct abstractions for the Time Petri Net (TPN) model, suitable to verify its linear or reachability properties. Experimental results have shown that these abstractions are very appropriate as both time and size are considerably reduced. For some tested models, abstractions that preserve reachability properties can be as many as 2,051 times smaller and more than 592 times faster to compute. For abstractions, which are overapproximations (useful to prove that certain states are not reachable), gains can overpass 10,000 for both time and size.
Keyword:
Formal methods
time Petri nets (TPN)
state class spaces
reachability properties
model checking
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Magnetic properties of CoFe1.9RE0.1O4 nanoparticles (RE=La, Ce, Nd, Sm, Eu, Gd, Tb, Ho) prepared in polyol在多元醇中制备的CoFe1.9RE0.1O4纳米颗粒 (RE = La，Ce，Nd，Sm，Eu，Gd，Tb，Ho) 的磁性能
PREAI
分享收藏C-Methylation Catalyzed by Fom3, a Cobalamin-Dependent Radical S-adenosyl-l-methionine Enzyme in Fosfomycin Biosynthesis, Proceeds with Inversion of Configuration.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Role of arginine-292 in the substrate specificity of aspartate aminotransferase as examined by site-directed mutagenesisBiochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容