Model Checking of Time Petri Nets

Boucheneb, Hanifa; Hadjidj, Rachid

doi:10.5772/5318

Cited by 3 publications

(1 citation statement)

References 30 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the task dependencies were conducted, the authors did not consider the actual data values of a task. In [21], an algorithm for reachability checking and flaw detection techniques were provided using time Petri nets (TPN) [22]. The abstract model was described using a formal mapping of the BPMN model into a time Petri nets model, but the authors did not consider the data flow of the BPMN model.…”

Section: Related Workmentioning

confidence: 99%

Hierarchical Verification for the BPMN Design Model Using State Space Analysis

2019

View full text Add to dashboard Cite

The BPMN design models are widely used in the software development process. Owing to the lack of BPMN standard semantics, formal verification is used to validate whether the BPMN design model is free of undesirable properties. The primary challenges of BPMN design model verification are the enormous size and complexity of BPMN design models; these challenges may lead to time-consuming processes for model abstraction and overcoming the state space explosion problem. This paper proposes a hierarchical verification technique for the state space analysis based on a colored Petri net (CPN). A BPMN partitioning technique and rules for the transformation of a BPMN into a CPN model are provided. The partitioning approach supports the unstructured BPMN design model, and the obtained CPN model also supports hierarchical verification. To validate and analyze the BPMN design model, the transformation technique and state space generator are implemented as a BPMN verification framework. This method is a viable option for the software process designers and is suitable for the large-scale BPMN design model verification.

show abstract

Section: Related Workmentioning

confidence: 99%

Hierarchical Verification for the BPMN Design Model Using State Space Analysis

2019

View full text Add to dashboard Cite

show abstract

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

Srba

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded platforms where reliability and safety depend to a large extent on the time features. Many of the time dependant models were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines with a finite number of real-valued clocks, and timed extensions of Petri nets where the added time constructs include e.g. time intervals that are assigned to the transitions (Time Petri Nets) or to the arcs (Timed-Arc Petri Nets). In this paper, we shall semiformally introduce these models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.

show abstract

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

Jbeli

Sbaï

2021

International Journal of Service Science, Management, Engineering, and Technology

View full text Add to dashboard Cite

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.

show abstract

Model Checking of Time Petri Nets

Cited by 3 publications

References 30 publications

Hierarchical Verification for the BPMN Design Model Using State Space Analysis

Hierarchical Verification for the BPMN Design Model Using State Space Analysis

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

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

Contact Info

Product

Resources

About