Towards an Algebraic Semantics of Software Evolution Process Models

Abstract

As a number of software evolution process models increased, as modeled by EPMM (software evolution process meta model), verifying the correctness of these models becomes the important. This paper extends EPMM with ACP (algebra of communicating processes) and proposes EPMM-A (software evolution meta modelalgebra). In order to discuss behavior verification in the unified framework of EPMM-A, a process term is used to define an algebraic semantics of a software evolution process model. Based on equational reasoning of EPMM-A, behavior verification of a software evolution process model emphasizes algebraic reasoning as opposed to modelbased reasoning. This method combines the advantages of both Petri nets and ACP, which can effectively support software evolution process formal verification.

A Petri Net Based Model for Trustworthy Software Process Composition

“…All these verifications had been implemented by us in [20]. Structure verification is to check the structural defects of process models.…”

“…A process specification defines the requirements of the process and the behaviors of these process requirements. Based on Park's bisimulation equivalence [21] the behavior equivalence between the process specification and the process model is verified in [20].…”

Software system evolution analysis method based on algebraic topology

“…Dynamic evolution refers to the evolution under the operating conditions [4] . It overcomes the shortcomings of static evolution, but dynamic changes such as the migration of the operating states and the active process [5] need to be considered, which can result in technical difficulties.…”