scholarly journals Model Checking Bounded Prioritized Time Petri Nets

2007 ◽  
pp. 523-532 ◽  
Author(s):  
Bernard Berthomieu ◽  
Florent Peres ◽  
François Vernadat
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Time Petri Nets

scholarly journals Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking

2020 ◽  
Vol E103.D (3) ◽  
pp. 702-705
Author(s):  
Nao IGAWA ◽  
Tomoyuki YOKOGAWA ◽  
Sousuke AMASAKI ◽  
Masafumi KONDO ◽  
Yoichiro SATO ◽  
...  
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Symbolic Representation ◽  
Bounded Model Checking ◽  
Time Petri Nets ◽  
Representation Of Time

scholarly journals Model Checking of Time Petri Nets Using the State Class Timed Automaton

2006 ◽  
Vol 16 (2) ◽  
pp. 179-205 ◽  
Author(s):  
Didier Lime ◽  
Olivier H. Roux
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
The State ◽  
Time Petri Nets ◽  
Timed Automaton

On Improving Model Checking of Time Petri Nets and Its Application to the Formal Verification

2021 ◽  
Vol 12 (4) ◽  
pp. 68-84
Author(s):  
Naima Jbeli ◽  
Zohra Sbai
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Formal Verification ◽  
State Space ◽  
Order Reduction ◽  
The State ◽  
Timing Constraints ◽  
Time Petri Nets ◽  
Explicit Timing ◽  
Class Graph

Time Petri nets (TPN) are successfully used in the specification and analysis of distributed systems that involve explicit timing constraints. Especially, model checking TPN is a hopeful method for the formal verification of such complex systems. For this, it is promising to lean to the construction of an optimized version of the state space. The well-known methods of state space abstraction are SCG (state class graph) and ZBG (graph based on zones). For ZBG, a symbolic state represents the real evaluations of the clocks of the TPN; it is thus possible to directly check quantitative time properties. However, this method suffers from the state space explosion. To attenuate this problem, the authors propose in this paper to combine the ZBG approach with the partial order reduction technique based on stubborn set, leading thus to the proposal of a new state space abstraction called reduced zone-based graph (RZBG). The authors show via case studies the efficiency of the RZBG which is implemented and integrated within the 〖TPN-TCTL〗_h^∆ model checking in the model checker Romeo.

scholarly journals TCTL Model Checking of Time Petri Nets

2009 ◽  
Vol 19 (6) ◽  
pp. 1509-1540 ◽  
Author(s):  
H. Boucheneb ◽  
G. Gardey ◽  
O. H. Roux
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Time Petri Nets

scholarly journals CTL* model checking for time Petri nets

2006 ◽  
Vol 353 (1-3) ◽  
pp. 208-227 ◽  
Author(s):  
Hanifa Boucheneb ◽  
Rachid Hadjidj
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Time Petri Nets
Sign in / Sign up

Export Citation Format

Share Document