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 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 Coloured Petri Nets - Exploiting Strongly Connected Components

1997 ◽  
Vol 26 (519) ◽  
Author(s):  
Allan Cheng ◽  
Søren Christensen ◽  
Kjeld Høyer Mortensen
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
The State ◽  
Connected Components ◽  
Coloured Petri Nets ◽  
Transition Systems ◽  
Strongly Connected Components ◽  
State Spaces ◽  
Labelled Transition Systems ◽  
Strongly Connected

In this paper we present a CTL-like logic which is interpreted over the state spaces of Coloured Petri Nets. The logic has been designed to express properties of both state and transition information. This is possible because the state spaces are labelled transition systems. We compare the expressiveness of our logic with CTL's. Then, we present a model checking algorithm which for efficiency reasons utilises strongly connected components and formula reduction rules. We present empirical results for non-trivial examples and compare the performance of our algorithm with that of Clarke, Emerson, and Sistla.

scholarly journals Dépliage des réseaux de Petri temporels à modèle sous-jacent non sauf

2011 ◽  
Vol Volume 14 - 2011 - Special... ◽  
Author(s):  
M. Sogbohossou ◽  
D. Delfieu
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
The State ◽  
Time Petri Nets ◽  
Real Time System ◽  
Time Petri Net ◽  
Finite Set ◽  
International Audience ◽  
Hard Real Time ◽  
Temporal Specifications

International audience For the formal verification of the concurrent or communicating dynamic systems modeled with Petri nets, the method of the unfolding is used to cope with the well-known problem of the state explosion. An extension of the method to the non safe time Petri nets is presented. The obtained unfolding is simply a prefix of that from the underlying ordinary Petri net to the time Petri net. For a certain class of time Petri nets, a finite prefix capturing the state space and the timed language ensues from the calculation of a finite set of finite processes with valid timings. The quantitative temporal constraints associated with these processes can serve to validate more effectively the temporal specifications of a hard real-time system. Pour la vérification formelle des systèmes dynamiques concurrents ou coopérants modélisés à l’aide des réseaux de Petri, la méthode du dépliage est utilisée pour endiguer le phénomène bien connu de l’explosion combinatoire. Une extension de la méthode aux réseaux de Petri temporels à modèle sous-jacent non sauf est présentée. Le dépliage obtenu est simplement un préfixe de celui du réseau de Petri ordinaire sous-jacent au réseau temporel. Pour une certaine classe de réseaux temporels, un préfixe fini capturant l’espace d’état et le langage temporisé découle du calcul d’un ensemble fini de processus finis réalisables. Les contraintes temporelles quantitatives associées à ces processus peuvent servir à valider plus efficacement les spécifications temporelles d’un système temps réel dur.

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
Sign in / Sign up

Export Citation Format

Share Document