Scientific publications

This paper presents results and observations from a survey of 120 industry practitioners in the feld of real-time embedded systems. The survey provides insights into the characteristics of the systems being developed today and identifes important trends for the future. It extends the results from the survey data to the broader population that it is representative of, and discusses signifcant diferences between application domains.

System-Performance Engineering (SysPE) encompasses modeling formalisms, methods, techniques, and industrial practices to design systems for performance, where performance is taken integrally into account during the whole system life cycle. Industrial SysPE state of practice is generally model-based. Due to the rapidly increasing complexity of systems, there is a need to develop and establish model-driven methods and techniques.

Configuring, instead of re-engineering, complex high-tech solutions increases development efficiency, reduces errors and saves money. For this, constructing a stable link between configurable modules and customer-facing variantions is paramount. Vanderlande and TNO's ESI have developed an approach to overcome this configurability challenge.

In the search for appropriate solutions, architects and stakeholders need ways to reason about concepts and their impact. The understanding, communication, and reasoning facilitates decision making. In this keynote, we explore conceptual models as the means to achieve all of these needs. We will make the abstract notion of conceptual models concrete by using future energy systems as an application area.

There is a constant increase of the market expectations on the capabilities of industrial high-tech systems. To meet these expectations, designers of such systems have to explore complex solutions that ensure both functionality and maximum up-time. We describe a methodology that supports the designers in this task.

There are many classes of Petri nets for describing communicating systems. Some of these guarantee important properties, such as termination in the case of portnets. There are also many methods and tools available for their analysis and synthesis. However, when developing new methods, or benchmarking against existing ones, it is often helpful to quickly generate large sets of random models satisfying certain properties and user-defined rules.

Maintaining large, multi-language code bases is challenging because of their size and complexity. Hence, tool support is desirable. Unfortunately, off-the-shelf tools fall short by aiming for genericity instead of exploiting characteristics of the specific code bases and maintenance tasks. Our objective is to support software maintenance by facilitating the development of custom tools for static code analysis.

Many real-world problems such as internet routing are actually graph problems. To develop efficient solutions to such problems, more and more parallel graph algorithms are proposed. This paper discusses the mechanized verification of a commonly used parallel graph algorithm, namely the Bellman–Ford algorithm, which provides an inherently parallel solution to the Single-Source Shortest Path problem.