Optimizing Verification of Structurally Evolving Algebraic Petri Nets

Khan, Yasir Imtiaz

doi:10.1007/978-3-642-40894-6_6

Cited by 7 publications

(7 citation statements)

References 14 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, efficient verification of linear-time temporal logic for variability-intensive systems in Classen et al (2010) or feature-oriented modular verification of software product lines in ter Beek and de Vink (2014). Khan (2013) investigates evolving Algebraic Petri Nets, how to perform verification on the parts of the system that are affected by the property that is analyzed, and how to identify evolutions that require verification. In ter Beek et al (2016) and Reniers and Thuijsman (2020), PLE has been applied in supervisory control.…”

Section: Related Workmentioning

confidence: 99%

Transformational supervisor synthesis for evolving systems

Thuijsman

Reniers

2022

Discrete Event Dyn Syst

View full text Add to dashboard Cite

Supervisory controller synthesis is a means to compute correct-by-construction controllers for discrete event systems. As these systems and their requirements evolve over time, an updated supervisor needs to be computed each time an adaptation takes place. We consider the case that a supervisor has been synthesized for a given model, after which this model is (slightly) adapted. We investigate how we can make use of the previous synthesis result, in order to more efficiently compute the supervisor for the adapted model. We introduce model deltas as a means to describe the difference between pairs of models. Using the model deltas, a notion of atomic adaptations is introduced. For these atomic adaptations, algorithms are provided to compute the supervisor for the adapted model in a transformational manner from the previous synthesis result, rather than performing a completely new synthesis. These atomic adaptations can be iterated over, to transformationally compute a supervisor for model deltas that contain a number of atomic adaptations. To improve efficiency, it is shown how atomic adaptations can be grouped together based on their required computations and be processed at the same time. A running example is used to support the explanations on the functioning of the algorithms. The efficiency of the method is evaluated by means of both an academic and an industrial use case.

show abstract

Section: Related Workmentioning

confidence: 99%

Transformational supervisor synthesis for evolving systems

Thuijsman

Reniers

2022

Discrete Event Dyn Syst

View full text Add to dashboard Cite

show abstract

“…Although many studies focused on defining the semantics precisely for BPMN [2, 5-8, 10, 34], few methodologies address the dynamic evolution of the BPMN formalization. In terms of the evolution of the Petri nets model, the evolution operations have been discussed in much research [47][48][49][50][51][52]. Hu et al [47] and Capra and Camilli [49] emphasized on the structural evolution (such as projection, link, difference, and substitution) of the Petri nets.…”

Section: Related Workmentioning

confidence: 99%

A Petri Nets Evolution Method that Supports BPMN Model Changes

2021

Scientific Programming

View full text Add to dashboard Cite

The correctness of the business process modelling notation (BPMN) is essential for software success, and the BPMN formalization is the foundation of the correctness verification process. However, dynamically adapting the formalized BPMN model to changes in the BPMN model and protecting tokens from being lost in the remapping formalization are the main limitations of the BPMN formalization under changing business requirements. To overcome these limitations, an approach for evolving a Petri nets model according to the BPMN changes is proposed in this paper. In this approach, a check algorithm is designed to identify the differences between the original BPMN model and the updated BPMN model. Then, the evolution rules of the extended Petri nets (EPN) model are defined according to the results of the checking program. Finally, these evolution rules are described in the query/view/transformation operational mapping (QVTo) language and implemented in the Eclipse platform. We demonstrate the effectiveness of the evolution of the BPMN formalization using a case study of the Web Payment business system. Moreover, the dynamic evolution of the BPMN formalization can maintain the consistency between the original model and the updated model, and this consistency has been successfully verified.

show abstract

“…In this section, we will study basic algorithms for static PN slicing [2][3][4][5][7][8][9]. The objective of every algorithm is to improve the verification process either by reducing a PN model or by partitioning a PN model.…”

Section: Static Slicing Algorithmsmentioning

confidence: 99%

“…To avoid the repeated model checking, a slicing based solution is proposed to reason about the previously satisfied properties [3]. At first, after the evolution of an APN model, slices are built for the evolved and non-evolved APN models with respect to the property by the APNSlicingEvo algorithm.…”

Section: After Applying Basic Slicingmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of Petri Nets Slicing

2018

Self Cite

View full text Add to dashboard Cite

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Petri nets slicing was first developed to facilitate debugging, but then was used for the alleviation of the state space explosion problem for the model checking of Petri nets. In this article, different slicing techniques are studied along with their algorithms introducing: (i) a classification of Petri nets slicing algorithms based on their construction methodology and objective (such as improving state space analysis or testing); (ii) a qualitative and quantitative discussion and comparison of major differences such as accuracy and efficiency: (iii) a syntactic unification of slicing algorithms that improve state space analysis for easy and clear understanding; and (iv) applications of slicing for multiple perspectives. Furthermore, some recent improvements to slicing algorithms are presented, which can certainly reduce the slice size even for strongly connected nets. A noteworthy use of this survey is for the selection and improvement of slicing techniques for optimizing the verification of state event models.

show abstract

Optimizing Verification of Structurally Evolving Algebraic Petri Nets

Cited by 7 publications

References 14 publications

Transformational supervisor synthesis for evolving systems

Transformational supervisor synthesis for evolving systems

A Petri Nets Evolution Method that Supports BPMN Model Changes

A Survey of Petri Nets Slicing

Contact Info

Product

Resources

About