Automatic abstraction refinement for Petri nets verification

2006 ◽  
Author(s):  
Zhenyu Chen ◽  
Conghua Zhou ◽  
Decheng Ding
Keyword(s):  
Petri Nets ◽  
Abstraction Refinement ◽  
Automatic Abstraction

scholarly journals From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

2007 ◽  
pp. 124-143 ◽  
Author(s):  
Pierre Ganty ◽  
Jean-François Raskin ◽  
Laurent Van Begin
Keyword(s):  
Petri Nets ◽  
Abstraction Refinement ◽  
Automatic Abstraction

Automatic abstraction refinement of TR for PDR

2016 ◽  
Author(s):  
Kuan Fan ◽  
Ming-Jen Yang ◽  
Chung-Yang Huang
Keyword(s):  
Abstraction Refinement ◽  
Automatic Abstraction

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

2014 ◽  
pp. 237-251 ◽  
Author(s):  
Sine Viesmose Birch ◽  
Thomas Stig Jacobsen ◽  
Jacob Jon Jensen ◽  
Christoffer Moesgaard ◽  
Niels Nørgaard Samuelsen ◽  
...  
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Abstraction Refinement

CONTROLLABILITY AND COOPERATIVENESS ANALYSIS FOR AUTOMATIC ABSTRACTION REFINEMENT

2006 ◽  
Vol 17 (04) ◽  
pp. 763-774
Author(s):  
FREDDY Y. C. MANG ◽  
PEI-HSIN HO
Keyword(s):  
Real World ◽  
Reachability Analysis ◽  
Experimental Results ◽  
The Other ◽  
Formal Property ◽  
Abstract Model ◽  
Abstraction Refinement ◽  
Automatic Abstraction ◽  
Property Verification ◽  
Refinement Algorithm

We present a new abstraction refinement algorithm to better refine the abstract model for formal property verification. In previous work, refinements are selected either based on a set of counter examples of the current abstract model, as in [5, 6, 7, 8, 9, 20, 21], or independent of any counter examples, as in [18]. We (1) introduce a new controllability analysis that is independent of any particular counter examples, (2) apply a new cooperativeness analysis that extracts information from a particular set of counter examples and (3) combine both to better refine the abstract model. We implemented the algorithm and applied it to verify several real-world designs and properties. We compared the algorithm against the abstraction refinement algorithms in [20] and [21] and the interpolation-based reachability analysis in [15]. The experimental results indicate that the new algorithm outperforms the other three algorithms in terms of runtime, abstraction efficiency (as defined in [20]) and the number of proven properties.

scholarly journals Automatic Abstraction Refinement for Timed Automata

2007 ◽  
pp. 114-129 ◽  
Author(s):  
Henning Dierks ◽  
Sebastian Kupferschmid ◽  
Kim G. Larsen
Keyword(s):  
Timed Automata ◽  
Abstraction Refinement ◽  
Automatic Abstraction

Petri nets

AccessScience ◽  
2015 ◽  
Keyword(s):  
Petri Nets
Sign in / Sign up

Export Citation Format

Share Document