Matthias Werner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Matthias Werner has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
Jan Richling
Dep. of Electrical Engineering and Information Technology, South Westphalia University of Applied Sciences, Hagen, Germany
7 shared publicationsMartin Däumler
Chemnitz University of Technology, Chemnitz, Germany
5 shared publications- Christine Jakobs
Operating Systems Group Chemnitz University of Technology
4 shared publications Gero Mühl
4 shared publicationsPeter Tröger
Chemnitz University of Technology Chemnitz, Germany
4 shared publicationsDirk Muller
3 shared publications
Latest Publications
- Open Access
- 1 January 2019
- Published by HICSS Conference Office
Dynamic Composition of Cyber-Physical Systems
Future cyber-physical systems must fulfill strong demands on timeliness and reliability, so that the safety of their operational environment is never violated. At the same time, such systems are networked computers with the typical demand for reconfigurability and software modification. The combination of both expectations makes established modeling and analysis techniques difficult to apply, since they cannot scale with the number of possible operational constellations resulting from the dynamics. The problem increases when components with different non-functional demands are combined to one cyber-physical system and updated independent from each other. We propose a new approach for the design and development of composable, dynamic and dependable software architectures, with a focus on the area of networked embedded systems. Our key concept is the specification of software components and their nonfunctional composition constraints in the formal language TLA+. We discuss how this technique can be embedded in an overall software design workflow, and show the practical applicability with a detailed resource scheduling example.
- 1 January 2019
- Published by HICSS Conference Office
Open AccessDynamic Composition of Cyber-Physical Systems
Future cyber-physical systems must fulfill strong demands on timeliness and reliability, so that the safety of their operational environment is never violated. At the same time, such systems are networked computers with the typical demand for reconfigurability and software modification. The combination of both expectations makes established modeling and analysis techniques difficult to apply, since they cannot scale with the number of possible operational constellations resulting from the dynamics. The problem increases when components with different non-functional demands are combined to one cyber-physical system and updated independent from each other. We propose a new approach for the design and development of composable, dynamic and dependable software architectures, with a focus on the area of networked embedded systems. Our key concept is the specification of software components and their nonfunctional composition constraints in the formal language TLA+. We discuss how this technique can be embedded in an overall software design workflow, and show the practical applicability with a detailed resource scheduling example.
- Open Access
- 24 June 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Dynamic vehicle software with AUTOCONT
- 24 June 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessDynamic vehicle software with AUTOCONT
- 31 January 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 157 (4) , 321-339
Superposition Principle in Composable Hybrid Automata
Hybrid automata are a well-established modelling approach. The formalism is used in many real-time and control systems engineering projects, which makes model composition an increasingly relevant topic. A well-defined composition support allows concu
- 31 January 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 157 (4) , 321-339
Superposition Principle in Composable Hybrid Automata
Hybrid automata are a well-established modelling approach. The formalism is used in many real-time and control systems engineering projects, which makes model composition an increasingly relevant topic. A well-defined composition support allows concu
- 20 October 2017
- Published by Springer Nature
- p. 629-641
Dynamic Paging Method Switching - An Implementation for KVM
- 20 October 2017
- Published by Springer Nature
- p. 629-641
Dynamic Paging Method Switching - An Implementation for KVM
- 26 August 2016
- Published by Springer Nature
- p. 13-27
Configurable Fault Trees
- 1 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 26-29
Adaptive cyber-physical systems with interpreted operating system kernels
In the new era of cyber-physical systems, software must adapt itself to ever-changing environmental conditions and situations. This is currently not reflected in the design of embedded operating systems, since they are primarily optimized for fixed usage scenarios with tight resource constraints. We discuss the idea of interpreted operating system kernels, which can form a new foundation for highly reconfigurable embedded systems. The paper elaborates reasonable use cases, shows comparable approaches from the past and sketches an implementation strategy that is based on a bare-metal Python interpreter.
- 1 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 26-29
Adaptive cyber-physical systems with interpreted operating system kernels
In the new era of cyber-physical systems, software must adapt itself to ever-changing environmental conditions and situations. This is currently not reflected in the design of embedded operating systems, since they are primarily optimized for fixed usage scenarios with tight resource constraints. We discuss the idea of interpreted operating system kernels, which can form a new foundation for highly reconfigurable embedded systems. The paper elaborates reasonable use cases, shows comparable approaches from the past and sketches an implementation strategy that is based on a bare-metal Python interpreter.
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Using timed automata to check space mission feasibility in the early design phases
According to the model-based systems engineering paradigm, all engineers contribute to a single centralized data model of the system. The German Aerospace Center (DLR) develops a software tool Virtual Satellite which enables the engineers to store, exchange and alter their corresponding subsystem data on base of a distributed system model and thus contribute to the overall mission design during concurrent engineering (CE) sessions. Each engineer has their own scope of responsibilities, e.g. satellite trajectory, communication, or thermal analysis. Tracking implications of design changes on the whole system and feasibility aspects of the design is not trivial. Having an automated feasibility checking mechanism as a part of CE which would run iteratively after each design change provides a useful feedback mechanism for engineers and for the spacecraft client. For the purpose of mission feasibility checking a domain specific language (DSL) has been implemented using the Xtext Java framework. The extended parametric data model defined in the DSL serves as an executable representation of the spacecraft mission. The idea to use such an executable model to create a preliminary mission plan and hence confirm missions feasibility during conceptual study has already been introduced by Schaus et al. at the DLR. However, the vector of values of system variables was assumed to be equivalent with the currently active component, implying that component activities are mutually exclusive. This led to over-constraining of the execution model. Our work argues that concurrency considerations are critical from the earliest design phases. Since satellite is coupled with its environment and concurrency is an intrinsic property of the physical nature, considering concurrency allows for more realistic mission plans. The contributions of this paper are the introduction of concurrency considerations at the early space mission design phases and the use of timed automata tool (UPPAAL) for the mission feasibility check during concurrent engineering sessions. As a result, with almost no overhead, the planned mission can be analyzed in a more realistic way. Furthermore, the run-times of the feasibility check amount to 10-100 milliseconds or less, which is also a significant improvement with respect to the previous work. This allows for more precision and fine granular modeling, and is a promising basis for model refinements in the consecutive mission design phases.
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Using timed automata to check space mission feasibility in the early design phases
According to the model-based systems engineering paradigm, all engineers contribute to a single centralized data model of the system. The German Aerospace Center (DLR) develops a software tool Virtual Satellite which enables the engineers to store, exchange and alter their corresponding subsystem data on base of a distributed system model and thus contribute to the overall mission design during concurrent engineering (CE) sessions. Each engineer has their own scope of responsibilities, e.g. satellite trajectory, communication, or thermal analysis. Tracking implications of design changes on the whole system and feasibility aspects of the design is not trivial. Having an automated feasibility checking mechanism as a part of CE which would run iteratively after each design change provides a useful feedback mechanism for engineers and for the spacecraft client. For the purpose of mission feasibility checking a domain specific language (DSL) has been implemented using the Xtext Java framework. The extended parametric data model defined in the DSL serves as an executable representation of the spacecraft mission. The idea to use such an executable model to create a preliminary mission plan and hence confirm missions feasibility during conceptual study has already been introduced by Schaus et al. at the DLR. However, the vector of values of system variables was assumed to be equivalent with the currently active component, implying that component activities are mutually exclusive. This led to over-constraining of the execution model. Our work argues that concurrency considerations are critical from the earliest design phases. Since satellite is coupled with its environment and concurrency is an intrinsic property of the physical nature, considering concurrency allows for more realistic mission plans. The contributions of this paper are the introduction of concurrency considerations at the early space mission design phases and the use of timed automata tool (UPPAAL) for the mission feasibility check during concurrent engineering sessions. As a result, with almost no overhead, the planned mission can be analyzed in a more realistic way. Furthermore, the run-times of the feasibility check amount to 10-100 milliseconds or less, which is also a significant improvement with respect to the previous work. This allows for more precision and fine granular modeling, and is a promising basis for model refinements in the consecutive mission design phases.
- 23 December 2015
- Published by Springer Nature
- p. 401-414
Ituitionistic Fuzzy Estimation of the Generalized Nets Model of Spatial-Temporal Group Scheduling Problems
- 23 December 2015
- Published by Springer Nature
- p. 401-414
Ituitionistic Fuzzy Estimation of the Generalized Nets Model of Spatial-Temporal Group Scheduling Problems
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-111
WAP: What activates a bug? A refinement of the Laprie terminology model
Dependability modeling and analysis relies on the usage of an unambiguous terminology model, in order to avoid misunderstandings and wrong interpretations. In both academia and industry, the most widely accepted approach is the fault-error-failure model, originally created by Avižienis and Laprie. Using this model for describing software faults and errors can help to establish a common vocabulary, but may lead to ambiguities, since the original `fault activation' term relates both to fault-enabling states and the execution of incorrect code. Our proposal encourages a more detailed description of fault activation conditions, while keeping the widely accepted basic vocabulary.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-111
WAP: What activates a bug? A refinement of the Laprie terminology model
Dependability modeling and analysis relies on the usage of an unambiguous terminology model, in order to avoid misunderstandings and wrong interpretations. In both academia and industry, the most widely accepted approach is the fault-error-failure model, originally created by Avižienis and Laprie. Using this model for describing software faults and errors can help to establish a common vocabulary, but may lead to ambiguities, since the original `fault activation' term relates both to fault-enabling states and the execution of incorrect code. Our proposal encourages a more detailed description of fault activation conditions, while keeping the widely accepted basic vocabulary.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 100-109
Bi-Level Deadline Scaling for Admission Control in Mixed-Criticality Systems
In some cases, tasks may be allowed to migrate from one processor to another, e.g., Due to hardware failures or for workload balancing. If a mixed-criticality setting is considered, it is necessary to decide whether new tasks with different levels of criticality may be accepted by a processor without compromising the already running tasks. Since this decision has to be taken on-line, there is a need for fast but yet accurate schedulability tests for mixed-criticality systems. In this paper, we consider that the EDF-VD algorithm is used to schedule tasks on the different processors. EDF-VD assigns virtual deadlines to high-criticality tasks, i.e., It uniformly downscales their real deadlines, to account for a potential increase in their execution demand. A deadline scaling factor is hence computed for the whole processor. However, in the case where the increase in computation demand strongly differs from one task to another, scaling deadlines uniformly makes EDF-VD incur pessimism. Of course, a scaling factor can be computed for every single task, however, this leads to a considerably more complex algorithm which cannot be used in an on-line setting. As a result, we propose an intermediate solution by introducing a bi-level deadline scaling. This way, high-criticality tasks that experience a small increase of workload are assigned one scaling factor, whereas tasks with a large increase of workload are assigned a separate scaling factor. Our experiments show that the proposed approach dominates the original EDF-VD algorithm while it does not increase complexity allowing for constant-time admission control in mixed-criticality systems.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 100-109
Bi-Level Deadline Scaling for Admission Control in Mixed-Criticality Systems
In some cases, tasks may be allowed to migrate from one processor to another, e.g., Due to hardware failures or for workload balancing. If a mixed-criticality setting is considered, it is necessary to decide whether new tasks with different levels of criticality may be accepted by a processor without compromising the already running tasks. Since this decision has to be taken on-line, there is a need for fast but yet accurate schedulability tests for mixed-criticality systems. In this paper, we consider that the EDF-VD algorithm is used to schedule tasks on the different processors. EDF-VD assigns virtual deadlines to high-criticality tasks, i.e., It uniformly downscales their real deadlines, to account for a potential increase in their execution demand. A deadline scaling factor is hence computed for the whole processor. However, in the case where the increase in computation demand strongly differs from one task to another, scaling deadlines uniformly makes EDF-VD incur pessimism. Of course, a scaling factor can be computed for every single task, however, this leads to a considerably more complex algorithm which cannot be used in an on-line setting. As a result, we propose an intermediate solution by introducing a bi-level deadline scaling. This way, high-criticality tasks that experience a small increase of workload are assigned one scaling factor, whereas tasks with a large increase of workload are assigned a separate scaling factor. Our experiments show that the proposed approach dominates the original EDF-VD algorithm while it does not increase complexity allowing for constant-time admission control in mixed-criticality systems.