Refine
Document Type
- Article (1)
- Conference Paper (1)
- Publication by THI (1)
Language
- English (3)
Institute
Review
- ja (1)
- peer-review (1)
Version
- published (1)
In this paper we investigate the use of Petri nets in software engineering extending the classical software development process with simulation and mathematical analysis based on place/transition nets. The advantage is that equirements can be validated earlier and fault detection and correction is less expensive. We show how to construct nets from basic patterns and demonstrate this for an application in automotive electronics, the cruise control with distance warning. The resulting nets can be simulated and analysed using Petri net tools and embedded into an object-oriented framework, where transitions are triggered by messages.
The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively.