Compositional Verification Using Petri Nets

Author(s):  
Eric Y. T. Juan ◽  
Jeffrey J. P. Tsai
2012 ◽  
pp. 201-222
Author(s):  
Yujian Fu ◽  
Zhijang Dong ◽  
Xudong He

The approach aims at solving the above problems by including the analysis and verification of two different levels of software development process–design level and implementation level-and bridging the gap between software architecture analysis and verification and the software product. In the architecture design level, to make sure the design correctness and attack the large scale of complex systems, the compositional verification is used by dividing and verifying each component individually and synthesizing them based on the driving theory. Then for those properties that cannot be verified on the design level, the design model is translated to implementation and runtime verification technique is adapted to the program. This approach can highly reduce the work on the design verification and avoid the state-explosion problem using model checking. Moreover, this approach can ensure both design and implementation correctness, and can further provide a high confident final software product. This approach is based on Software Architecture Model (SAM) that was proposed by Florida International University in 1999. SAM is a formal specification and built on the pair of component-connector with two formalisms – Petri nets and temporal logic. The ACV approach places strong demands on an organization to articulate those quality attributes of primary importance. It also requires a selection of benchmark combination points with which to verify integrated properties. The purpose of the ACV is not to commend particular architectures, but to provide a method for verification and analysis of large scale software systems in architecture level. The future research works fall in two directions. In the compositional verification of SAM model, it is possible that there is circular waiting of certain data among different component and connectors. This problem was not discussed in the current work. The translation of SAM to implementation is based on the restricted Petri nets due to the undecidable issue of high level Petri nets. In the runtime analysis of implementation, extraction of the execution trace of the program is still needed to get a white box view, and further analysis of execution can provide more information of the product correctness.


Author(s):  
Dinh-Thuan Le ◽  
Huu-Vu Nguyen ◽  
Van-Tinh Nguyen ◽  
Phuong-Nam Mai ◽  
Bao-Trung Pham-Duy ◽  
...  

2006 ◽  
Vol 15 (04) ◽  
pp. 551-570 ◽  
Author(s):  
LI JIAO ◽  
TO-YAT CHEUNG

A workflow is the automation of business processes that describe activities in a business context. Petri nets have been widely used as a workflow modeling technique. Workflow nets (WF-nets), introduced by van der Aalst [LNCS1248 (1997) 407–426], are a class of Petri nets tailored towards workflow analysis. Soundness is used as the least correctness criterion for WF-nets in order to ensure that a process can terminate properly. This paper extends WF-nets by considering resources and allowing for multi-cases in a process. For the extended model, the relationship between soundness and standard behavior properties of Petri nets is investigated. A compositional method to construct and verify sound WF-nets is introduced.


Author(s):  
Yujian Fu ◽  
Zhijang Dong ◽  
Xudong He

The approach aims at solving the above problems by including the analysis and verification of two different levels of software development process–design level and implementation level-and bridging the gap between software architecture analysis and verification and the software product. In the architecture design level, to make sure the design correctness and attack the large scale of complex systems, the compositional verification is used by dividing and verifying each component individually and synthesizing them based on the driving theory. Then for those properties that cannot be verified on the design level, the design model is translated to implementation and runtime verification technique is adapted to the program. This approach can highly reduce the work on the design verification and avoid the state-explosion problem using model checking. Moreover, this approach can ensure both design and implementation correctness, and can further provide a high confident final software product. This approach is based on Software Architecture Model (SAM) that was proposed by Florida International University in 1999. SAM is a formal specification and built on the pair of component-connector with two formalisms – Petri nets and temporal logic. The ACV approach places strong demands on an organization to articulate those quality attributes of primary importance. It also requires a selection of benchmark combination points with which to verify integrated properties. The purpose of the ACV is not to commend particular architectures, but to provide a method for verification and analysis of large scale software systems in architecture level. The future research works fall in two directions. In the compositional verification of SAM model, it is possible that there is circular waiting of certain data among different component and connectors. This problem was not discussed in the current work. The translation of SAM to implementation is based on the restricted Petri nets due to the undecidable issue of high level Petri nets. In the runtime analysis of implementation, extraction of the execution trace of the program is still needed to get a white box view, and further analysis of execution can provide more information of the product correctness.


Author(s):  
Rosemarie Yagoda ◽  
Michael D. Coovert

1988 ◽  
Vol 135 (4) ◽  
pp. 239 ◽  
Author(s):  
J. Duggan ◽  
J. Browne
Keyword(s):  

1995 ◽  
Vol 115 (7) ◽  
pp. 914-919
Author(s):  
Kazuyuki Mori ◽  
Makoto Tsukiyama ◽  
Toyoo Fukuda

2009 ◽  
Vol 129 (5) ◽  
pp. 455-461 ◽  
Author(s):  
Xinhong Hei ◽  
Sei Takahashi ◽  
Hideo Nakamura
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document