@inproceedings{26701,
  abstract     = {{Machines are omnipresent. They produce, they transport. Machines facilitate work and assist. The increasing penetration of mechanical engineering by information technology enables considerable benefits. We refer to such systems as advanced mechatronic systems, which relay on the close interaction of mechanics, electric/electronics, control engineering and software engineering. Hence, the design and production of such systems is an interdisciplinary and complex task. Our ambition is a new school for the design of advanced mechatronic systems. Consequently, we need an avant-garde basic system which can be used to develop and to test future applications. The miniature robot BeBot is such a basic system. This robot constitutes the test bench for the applications, being based on modern approaches, such as self-optimization, self-organization and self-coordination as well as on the use of new manufacturing technologies.
}},
  author       = {{Gausemeier, Jürgen and Schierbaum, Thomas and Dumitrescu, Roman and Herbrechtsmeier, Stefan and Jungmann, Alexander}},
  booktitle    = {{Proceedings of the 9th IEEE International Conference on Industrial Informatics (INDIN)}},
  publisher    = {{IEEE}},
  title        = {{{Miniature Robot BeBot: Mechatronic Test Platform for Self-X Properties}}},
  year         = {{2011}},
}

@inproceedings{26702,
  author       = {{Thuy, Andreas}},
  booktitle    = {{Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC), 2011 6th International Workshop on }},
  publisher    = {{IEEE Xplore}},
  title        = {{{ Comparison of periodic and aperiodic task models for cyber-physical-systems}}},
  year         = {{2011}},
}

@article{26705,
  abstract     = {{In the area of dynamic verification of virtual prototypes, functional coverage is a valuable tool for answering the "Are we done?" question and achieving verification closure. Recent verification methodologies such as OVM and UVM contain multi-language support that provides a basic SystemC version. However, due to language shortcoming they cannot be utilized for the same amount of verification tasks in the SystemC ecosystem as in other supported hardware design and verification languages. In this presentation, we propose to boost the verification capabilities of SystemC by implementing functional coverage collection and evaluation according to the same metric as defined in the widely accepted IEEE-1800 SystemVerilog cover group feature. We implement a functional coverage library to enable coverage-driven verification of SystemC designs on multiple levels of abstraction enabling value, transition, and expression coverage. To our knowledge, the overall functionalities are not available in the IEEE-1666 SystemC standard or the SCV add-on library, nor are they complete compared to the aforementioned in any publicly available SystemC library.
}},
  author       = {{Kuznik, Christoph and Müller, Wolfgang}},
  journal      = {{North American SystemC User Group Meeting (16th)}},
  title        = {{{Verification Closure of SystemC Designs with Functional Coverage}}},
  year         = {{2011}},
}

@inproceedings{26707,
  abstract     = {{Planar graph routing works provably correct if the underlying network graph is connected and planar. Typically, wireless networks modeled as 2D graphs, are not planar and planar graph routing applied on such unprocessed network graphs may fail. Planarizing a given connected graph by removing intersecting links might be impossible if the outcome still needs to be a connected subgraph. It becomes even more difficult with distributed planarization techniques, where each node is allowed to use only the information about its local neighborhood. Furthermore, it is getting complicated if the nodes' assigned positions do not reflect the exact physical location. With or without exact location information, the outcome might be disconnected, nonplanar, or both of it. With all these unsolvable problems, the question arises how to apply planar graph routing in a realistic network setting? Fortunately, wireless network graphs bear one property which distinguishes them from arbitrary graphs: due to limited communication range, network links cannot become arbitrarily long. In this work we exploit this locality property to build a new localized planarization algorithm, which is location fault tolerant and which produces planar connected graphs in most cases in realistic wireless models. We evaluate our algorithm using the Log Normal Shadowing model and show that our algorithm always produces planar connected graphs in all simulations even when large location errors are present.
}},
  author       = {{Mathews, Emi and Frey, Hannes}},
  booktitle    = {{IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)}},
  pages        = {{1--9}},
  publisher    = {{ IEEE Computer Society}},
  title        = {{{A Localized Planarization Algorithm for Realistic Wireless Networks}}},
  year         = {{2011}},
}

@inproceedings{26710,
  author       = {{Becker, Markus and Zabel, Henning and Müller, Wolfgang and Elfeky, Ahmed and DiPasquale, Anthony}},
  booktitle    = {{8. Paderborner Workshop Entwurf mechatronischer Systeme, Band 294}},
  pages        = {{315--327}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Virtual Prototyping softwareintensiver mechatronischer Systeme – Eine Fallstudie}}},
  volume       = {{294}},
  year         = {{2011}},
}

@article{26711,
  author       = {{Rasche, Christoph and Stern, Claudius and Kleinjohann, Lisa and Kleinjohann, Bernd}},
  journal      = {{ThinkMind, International Journal On Advances in Software 3 (3&4)}},
  pages        = {{351--370}},
  title        = {{{Coordinated Exploration and Goal-Oriented Path Planning using Multiple UAVs}}},
  year         = {{2011}},
}

@inproceedings{26712,
  author       = {{Khaluf, Yara and Mathews, Emi and Rammig, Franz-Josef}},
  booktitle    = {{14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops (ISORCW)}},
  pages        = {{217--226}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{ Self-Organized Cooperation in Swarm Robotics}}},
  year         = {{2011}},
}

@inproceedings{26713,
  author       = {{Klobedanz, Kay and König, A. and Müller, Wolfgang}},
  booktitle    = {{Proceedings of Design, Automation, Test Europe - DATE2011}},
  location     = {{14. - 18. Mrz. 2011}},
  publisher    = {{IEEE Computer Society Press}},
  title        = {{{A Reconfiguration Approach for Fault-Tolerant FlexRay Networks}}},
  year         = {{2011}},
}

@inproceedings{26714,
  author       = {{Klobedanz, Kay and König, A. and Müller, Wolfgang and Rettberg, Achim}},
  booktitle    = {{Second IEEE Workshop on Self-Organizing Real-Time Systems - SORT 2011}},
  publisher    = {{IEEE Computer Society Press}},
  title        = {{{Self-Reconfiguration for Fault-Tolerant FlexRay Networks}}},
  year         = {{2011}},
}

@inproceedings{26715,
  abstract     = {{SystemC is a versatile C++ based design and verification language, offering various mechanisms and constructs required for embedded systems modeling. Using the add-on SystemC Verification Library (SCV) elemental constrained-random stimuli techniques may be used for verification. However, SCV has several drawbacks such as lack of a functional coverage facility supporting coverage collection on RTL and TLM models. In this article we present a functional coverage library which implements parts of the IEEE 1800-2005 SystemVerilog standard capturing functional coverage throughout the design and verification process, and allows to facilitate coverage-driven verification in SystemC.}},
  author       = {{Kuznik, Christoph and Müller, Wolfgang}},
  booktitle    = {{Proceedings of DVCON }},
  title        = {{{Functional Coverage-driven Verification with SystemC on Multiple Level of Abstraction}}},
  year         = {{2011}},
}

@inproceedings{26716,
  abstract     = {{UML profiles like SysML and MARTE have been a major research topic in electronic system design, but are mainly applied for specification and analysis in early design phases. High-Level Synthesis (HLS), however, addresses the physical implementation aspect of electronic systems, and thus leads to different requirements on the accuracy of models. For this, modular interfaces are a novel object-oriented synthesizable technique to overcome the conflict between a higher degree of abstraction and necessary details for further synthesis. In this paper, we present our approach to use SysML as an adequate modeling language for modular interfaces and C/C++/SystemC-based HLS. We extended SysML with annotations for synthesizable SystemC and high-level synthesis constraints and implemented a code generation scheme to achieve design flow automation. Based on the SysML editor Artisan Studio and an industrial case study, we demonstrate the applicability of SysML as a retargetable front-end for HLS design flows.}},
  author       = {{Mischkalla, Fabian and He, Da and Müller, Wolfgang}},
  booktitle    = {{Proceedings of 2nd Workshop on Model Based Engineering for Embedded Systems Design (M-BED)}},
  title        = {{{A Retargetable SysML-based Front-End for High-Level Synthesis}}},
  year         = {{2011}},
}

@inproceedings{26717,
  author       = {{He, Da and Mischkalla, Fabian and Müller, Wolfgang}},
  booktitle    = {{Proceedings of 1st international QEMU Users Forum}},
  title        = {{{A SysML-based Framework with QEMU-SystemC Code Generation}}},
  year         = {{2011}},
}

@inproceedings{26782,
  author       = {{Becker, Markus}},
  booktitle    = {{1st International QEMU Users Forum (QUF'11)}},
  title        = {{{QEMU/SystemC Cosimulation at Different Abstraction Levels}}},
  year         = {{2011}},
}

@inbook{26783,
  author       = {{Adelt, Philipp and Esau, Natascha and Hölscher, Christian and Kleinjohann, Bernd and Kleinjohann, Lisa and Krüger, Martin and Zimmer, Detmar}},
  booktitle    = {{ Intelligent Mechatronics; Kapitel 10}},
  pages        = {{169--194}},
  publisher    = {{InTech Open Access Publisher}},
  title        = {{{Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems}}},
  year         = {{2011}},
}

@inproceedings{26784,
  author       = {{Gnokam Defo, Gilles Bertrand and Müller, Wolfgang}},
  booktitle    = {{Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV)}},
  title        = {{{Synchronisation eines SystemC Restbus-Simulators mit einem Hardware-In-the-Loop FlexRay Netzwerk}}},
  year         = {{2011}},
}

@inproceedings{26787,
  author       = {{Khaluf, Lial and Gerth, Christian and Engels, Gregor}},
  booktitle    = {{Proceedings of the 23rd international conference on Advanced information systems engineering (CAiSE'11)}},
  pages        = {{521--535}},
  publisher    = {{Springer Verlag}},
  title        = {{{Pattern-Based Modeling and Formalizing of Business Process Quality Constraints}}},
  year         = {{2011}},
}

@inproceedings{26789,
  abstract     = {{Mutation analysis is a powerful tool for white-box testing of the verification environment in order to produce dependable and higher quality software products. However, due to high computational costs and the focus on high-level software languages such as Java mutation analysis is not yet widely used in commercial design flows targeting embedded (software) systems. Here the industry is modeling both hardware and related software parts at higher levels of abstraction, called virtual prototypes, to accelerate parallel development and shorten time-to-market. In this paper we propose a mutation testing verification flow for SystemC based virtual prototypes that may not rely on source code only but on annotated basic blocks and enables mutant creation at assembler level to heavily reduce execution costs and equivalence mutants likelihood.}},
  author       = {{Kuznik, Christoph and Müller, Wolfgang}},
  booktitle    = {{Proceedings of the 17th IEEE Pacific Rim International Symposium on Dependable Computing}},
  title        = {{{Native binary mutation analysis for embedded software and virtual prototypes in SystemC}}},
  year         = {{2011}},
}

@inbook{26792,
  author       = {{Esau, Natascha and Kleinjohann, Lisa}},
  booktitle    = {{Emotional Engineering}},
  pages        = {{119--142}},
  publisher    = {{Springer-Verlag London}},
  title        = {{{Emotional Robot Competence and Its Use in Robot Behavior Control}}},
  year         = {{2011}},
}

@inproceedings{26794,
  abstract     = {{In this paper we introduce an infrastructure for investigating Organic Computing principles such as self-optimization and self-organization in real-world scenarios based on a heterogeneous society of robots. This infrastructure, the R3PB-Workbench (Remote Real Robots at the University of Paderborn), provides a controlled environment for conducting real-world multi robot experiments, while relieving the developer from common problems like getting a global view of the entire environment and self-localization within this environment. In addition, it provides a communication layer that hides the heterogeneity of the controlled robot types and also facilitates access to each robot's subjective view. Currently we provide three types of mobile robots with different size and capabilities. Since the workbench is easily customizable, it supports the integration of additional types of robots. Hence, the degree of heterogeneity of the robot group conducting the experiments in the scope of our real-world scenario can be modified as needed. Furthermore, we elaborated a multi-robot game as an illustrative real-world scenario, which on the one hand allows for sophisticated scientific investigations and on the other hand is also appealing for an audience, even with little technical background.}},
  author       = {{Jungmann, Alexander and Lutterbeck, Jan and Werdehausen, Benjamin and Kleinjohann, Bernd and Kleinjohann, Lisa}},
  booktitle    = {{Proceedings of the 2011 workshop on Organic computing}},
  pages        = {{41--50}},
  publisher    = {{ACM}},
  title        = {{{Towards a Real-World Scenario for Investigating Organic Computing Principles in Heterogeneous Societies of Robots}}},
  year         = {{2011}},
}

@inbook{26805,
  abstract     = {{In this article we present an approach that enables robots to learn how to act and react robustly in continuous and noisy environments while not loosing track of the overall feasibility, i.e. minimising the execution time in order to keep up continuous learning. We do so by combining reinforcement learning mechanisms with techniques belonging to the field of multivariate statistics on three different levels of abstraction: the motivation layer and the two simultaneously learning strategy and skill layers. The motivation layer allows for modelling occasionally contradicting goals in terms of drives in a very intuitive fashion. A drive represents one single goal, that a robot wants to be satisfied, like charging its battery, when it is nearly exhausted, or transporting an object to a target position. The strategy layer encapsulates the main reinforcement learning algorithm based on an abstracted and dynamically adjusted Markovian state space. By means of state abstraction, we minimise the overall state space size in order to ensure feasibility of the learning process in a dynamically changing environment. The skill layer finally realises a generalised learning method for learning reactive low-level behaviours, that enable a robot to interact with the environment.}},
  author       = {{Jungmann, Alexander and Kleinjohann, Bernd and Richert, Willi}},
  booktitle    = {{Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems}},
  pages        = {{545--558}},
  publisher    = {{Springer Basel}},
  title        = {{{A Fast Hierarchical Learning Approach for Autonomous Robots}}},
  doi          = {{10.1007/978-3-0348-0130-0_36}},
  year         = {{2011}},
}