Modal µ-Calculus, Model Checking and Gauß Elimination

In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gauß elimination for linear equation systems. It does not require backtracking techniques. Within one framework we suggest a global and a local algorithm. In the context of model checking in the modal-calculus the local algorithm is related to the tableau methods, but has a better worst case complexity

Model checking embedded system designs

We survey the basic principles behind the application of model checking to controller verification and synthesis. A promising development is the area of guided model checking, in which the state space search strategy of the model checking algorithm can be influenced to visit more interesting sets of states first. In particular, we discuss how model checking can be combined with heuristic cost functions to guide search strategies. Finally, we list a number of current research developments, especially in the area of reachability analysis for optimal control and related issues

System Design as a Creative Mathematical Activity

This paper contributes to the understanding of rational systems design and verification. We give evidence that the rôle of mathematics in development and verification is not limited to useful calculations: Ideally, designing is a creative mathematical activity, which comprises finding a theorem, if necessary strengthening its assumptions until it can be proven. A canonical form of this ‘verification theorem’ is introduced and illustrated with informal and formal examples. Although for good reasons most systems are designed without use of formal methods it may be a source of useful insight to understand all design as an ‘approximation’ of such a mathematical activity. This leads amongst others to a taxonomy of design decisions, and it may help to relate paradigms, theories, methods, languages, and tools from different areas of computer science to each other to make optimal use of them

Single Value Devices

We live in a world of continuous information overflow, but the quality of information and communication is suffering. Single value devices contribute to the information and communication quality by fo- cussing on one explicit, relevant piece of information. The information is decoupled from a computer and represented in an object, integrates into daily life. However, most existing single value devices come from conceptual experiments or art and exist only as prototypes. In order to get to mature products and to design meaningful, effective and work- ing objects, an integral perspective on the design choices is necessary. Our contribution is a critical exploration of the design space of single value devices. In a survey we give an overview of existing examples. The characterizing design criteria for single value devices are elaborated in a taxonomy. Finally, we discuss several design choices that are specifically important for moving from prototypes to commercializable products

The Construction of Verification Models for Embedded Systems

The usefulness of verification hinges on the quality of the verification model. Verification is useful if it increases our confidence that an artefact bahaves as expected. As modelling inherently contains non-formal elements, the qualityof models cannot be captured by purely formal means. Still, we argue that modelling is not an act of irrationalism and unpredictable geniality, but follows rational arguments, that often remain implicit. In this paper we try to identify the tacit rationalism in the model construction as performed by most people doing modelling for verification. By explicating the different phases, arguments, and design decisions in the model construction, we try to develop guidelines that help to improve the process of model construction and the quality of models