@inproceedings{37011,
  abstract     = {{Safety-critical automotive systems must fulfill hard real-time constraints for reliability and safety. This paper presents a case study for the application of an AUTOSAR-based language for timing modeling and analysis. We present and apply the Timing Augmented Description Language (TADL) and demonstrate a methodology for the development of a speed-adaptive steer-by-wire system. We examine the impact of TADL and the methodology on the development process and the suitability and interoperability of the applied tools with respect to the AUTOSAR-based tool chain in the context of our case study.}},
  author       = {{Klobedanz, Kay and Kuznik, Christoph and Thuy, Andre and Müller, Wolfgang}},
  booktitle    = {{Proceedings of DATE’10, Dresden}},
  keywords     = {{Timing, Programming, Automotive engineering, Application software, Hardware, Computer architecture, Communication system software, Software architecture, Delay, Software standards}},
  location     = {{Dresden}},
  publisher    = {{IEEE}},
  title        = {{{Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study}}},
  doi          = {{10.1109/DATE.2010.5457125}},
  year         = {{2010}},
}

@inproceedings{37040,
  abstract     = {{Refinement of untimed TLM models into a timed HW/SW platform is a step by step design process which is a trade-off between timing accuracy of the used models and correct estimation of the final timing performance. The use of an RTOS on the target platform is mandatory in the case real-time properties must be guaranteed. Thus, the question is when the RTOS must be introduced in this step by step refinement process. This paper proposes a four-level RTOS-aware refinement methodology that, starting from an untimed TLM SystemC description of the whole system, progressively introduce HW/SW partitioning, timing, device driver and RTOS functionalities, till to obtain an accurate model of the final platform, where SW tasks run upon an RTOS hosted by QEMU and HW components are modeled by cycle accurate TLM descriptions. Each refinement level allows the designer to estimate more and more accurate timing properties, thus anticipating design decisions without being constrained to leave timing analysis to the final step of the refinement. The effectiveness of the methodology has been evaluated in the design of two complex platforms.}},
  author       = {{Becker, Markus and Di Guglielmo, Giuseppe and Fummi, Franco and Müller, Wolfgang and Pravadelli, Graziano and Xie, Tao}},
  booktitle    = {{Proceedings of DATE’10}},
  keywords     = {{Timing, Hardware, Operating systems, Process design, Accuracy, Standards development, Context modeling, Real time systems, Communication channels, Microprogramming}},
  location     = {{Dresden}},
  publisher    = {{IEEE}},
  title        = {{{RTOS-Aware Refinement for TLM2.0-based HW/SW Design}}},
  doi          = {{10.1109/DATE.2010.5456965}},
  year         = {{2010}},
}

@inproceedings{37044,
  abstract     = {{In this paper we present new concepts to resolve ECU (Electronic Control Unit) failures in FlexRay networks. Our approach extends the FlexRay bus schedule by redundant slots with modifications in the communication and slot assignment. We introduce additional backup nodes to replace faulty nodes. To reduce the required memory resources of the backup nodes, we distribute redundant tasks over different nodes and propose the migration of tasks to the backup node at runtime. We investigate different solutions to migrate the redundant tasks to the backup node by time-triggered and event-triggered transmissions.}},
  author       = {{Klobedanz, Kay and Defo, Gilles B. and Zabel, Henning and Müller, Wolfgang and Zhi, Yuan}},
  editor       = {{Kleinjohann, L. and Kleinjohann, B.}},
  isbn         = {{978-3-642-15233-7}},
  keywords     = {{Faulty Node     Static Segment     Slot Assignment     Task Migration     Communication Controller}},
  publisher    = {{Springer Verlag}},
  title        = {{{Task Migration for Fault-Tolerant FlexRay Networks}}},
  doi          = {{10.1007/978-3-642-15234-4_7}},
  year         = {{2010}},
}

@inproceedings{37039,
  abstract     = {{Refinement of untimed TLM models into a timed HW/SW platform is a step by step design process which is a trade-off between timing accuracy of the used models and correct estimation of the final timing performance. The use of an RTOS on the target platform is mandatory in the case real-time properties must be guaranteed. Thus, the question is when the RTOS must be introduced in this step by step refinement process. This paper proposes a four-level RTOS-aware refinement methodology that, starting from an untimed TLM SystemC description of the whole system, progressively introduce HW/SW partitioning, timing, device driver and RTOS functionalities, till to obtain an accurate model of the final platform, where SW tasks run upon an RTOS hosted by QEMU and HW components are modeled by cycle accurate TLM descriptions. Each refinement level allows the designer to estimate more and more accurate timing properties, thus anticipating design decisions without being constrained to leave timing analysis to the final step of the refinement. The effectiveness of the methodology has been evaluated in the design of two complex platforms.}},
  author       = {{Becker, Markus and Di Guglielmo, Giuseppe and Fummi, Franco and Müller, Wolfgang and Pravadelli, Graziano and Xie, Tao}},
  booktitle    = {{Proceedings of DATE’10}},
  keywords     = {{Timing, Hardware, Operating systems, Process design, Accuracy, Standards development, Context modeling, Real time systems, Communication channels, Microprogramming}},
  location     = {{Dresden}},
  publisher    = {{IEEE}},
  title        = {{{RTOS-Aware Refinement for TLM2.0-based HW/SW Design}}},
  doi          = {{10.1109/DATE.2010.5456965}},
  year         = {{2010}},
}

@article{11820,
  abstract     = {{In this paper, we derive an uncertainty decoding rule for automatic speech recognition (ASR), which accounts for both corrupted observations and inter-frame correlation. The conditional independence assumption, prevalent in hidden Markov model-based ASR, is relaxed to obtain a clean speech posterior that is conditioned on the complete observed feature vector sequence. This is a more informative posterior than one conditioned only on the current observation. The novel decoding is used to obtain a transmission-error robust remote ASR system, where the speech capturing unit is connected to the decoder via an error-prone communication network. We show how the clean speech posterior can be computed for communication links being characterized by either bit errors or packet loss. Recognition results are presented for both distributed and network speech recognition, where in the latter case common voice-over-IP codecs are employed.}},
  author       = {{Ion, Valentin and Haeb-Umbach, Reinhold}},
  journal      = {{IEEE Transactions on Audio, Speech, and Language Processing}},
  keywords     = {{automatic speech recognition, bit errors, codecs, communication links, corrupted observations, decoding, distributed speech recognition, error-prone communication network, feature vector sequence, hidden Markov model-based ASR, hidden Markov models, inter-frame correlation, Internet telephony, network speech recognition, packet loss, speech posterior, speech recognition, transmission error robust speech recognition, uncertainty decoding, voice-over-IP codecs}},
  number       = {{5}},
  pages        = {{1047--1060}},
  title        = {{{A Novel Uncertainty Decoding Rule With Applications to Transmission Error Robust Speech Recognition}}},
  doi          = {{10.1109/TASL.2008.925879}},
  volume       = {{16}},
  year         = {{2008}},
}

@inproceedings{11824,
  abstract     = {{Soft-feature based speech recognition, which is an example of uncertainty decoding, has been proven to be a robust error mitigation method for distributed speech recognition over wireless channels exhibiting bit errors. In this paper we extend this concept to packet-oriented transmissions. The a posteriori probability density function of the lost feature vector, given the closest received neighbours, is computed. In the experiments, the nearest frame repetition, which is shown to be equivalent to the MAP estimate, outperforms the MMSE estimate for long bursts. Taking the variance into account at the speech recognition stage results in superior performance compared to classical schemes using point estimates. A computationally and memory efficient implementation of the proposed packet loss compensation scheme based on table lookup is presented}},
  author       = {{Ion, Valentin and Haeb-Umbach, Reinhold}},
  booktitle    = {{IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)}},
  keywords     = {{distributed speech recognition, least mean squares methods, MAP estimate, maximum likelihood estimation, MMSE estimate, packet loss compensation scheme, packet switched communication, posteriori probability density function, robust error mitigation method, soft-features, speech recognition, table lookup, voice communication, wireless channels}},
  pages        = {{I}},
  title        = {{{An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features}}},
  doi          = {{10.1109/ICASSP.2006.1659984}},
  volume       = {{1}},
  year         = {{2006}},
}

@inproceedings{39052,
  abstract     = {{Smart homes provide their users with maximum comfort and convenience. In this paper, we present a profile management framework for situation-dependent customization in smart home environments, which meet the user preferences with given device capabilities. We apply profile processing and evolution methods to customize profiles on the fly and to automatically evolve user preferences. Furthermore, we give a comprehensive study on profile management technology.}},
  author       = {{Groppe, Jinghua and Müller, Wolfgang}},
  booktitle    = {{Proceedings of the 1st International Workshop on Secure and Ubiquitous Networks (SUN-2005)}},
  isbn         = {{0-7695-2424-9}},
  keywords     = {{Technology management, Smart homes, Environmental management, Resource description framework, Data models, Navigation, Mobile computing, Embedded computing, Ubiquitous computing, Mobile communication}},
  location     = {{Copenhagen, Denmark }},
  publisher    = {{IEEE}},
  title        = {{{Profile Management technology for Smart Customization in Private Home Applications}}},
  doi          = {{10.1109/DEXA.2005.156}},
  year         = {{2005}},
}

@inproceedings{11733,
  abstract     = {{Current navigation systems like GPS (Global Positioning System) and its Russian counterpart GLONASS (Global Navigation Satellite System) only evaluate the direct signal path. The receivers treat the reflected paths also reaching the receiver antenna as disturbance which has to be suppressed. Multipath affects the tracking accuracy by resulting in a degeneration of the S-curve of the DLL (delay locked loop). Nowadays the future European systems GALILEO and GPSIIF/III with two new signals are on the way to the market and it is time to think about new receiver structures. Therefore we investigated if it is possible to use multipath for navigation constructively.}},
  author       = {{Bischoff, Renke and Haeb-Umbach, Reinhold and Schulz, Wolfgang and Heinrichs, Guenther}},
  booktitle    = {{IEEE 55th Vehicular Technology Conference (VTC 2002 Spring)}},
  keywords     = {{combined GALILEO/UMTS receiver, delay locked loop, delay lock loops, DLL, Global Positioning System, GLONASS, GPS, GPSIIF/III, mobile satellite communication, multipath channels, multipath receiver structure, radio receivers, RAKE receiver, S-curve}},
  pages        = {{1844--1848 vol.4}},
  title        = {{{Employment of a multipath receiver structure in a combined GALILEO/UMTS receiver}}},
  doi          = {{10.1109/VTC.2002.1002940}},
  volume       = {{4}},
  year         = {{2002}},
}

@inproceedings{39488,
  abstract     = {{CSCW systems like BSCW (Basic Support for Cooperative Work), HyperNews, and Lotus Notes have been successfully introduced to support the cooperation of geographically distributed work groups. Unfortunately, some of these software systems are not flexible enough to be customized easily to the requirements of an individual user. Most of the environments can only be configured by experts through complex programming. In this article we introduce VIP space, a shared workspace space in the sense of exchanging and processing shared objects between members of distributed work groups. VIP space can be easily adapted to the user's individual views and needs by means of a visual programming language. In VIP space, objects of the shared workspace are moved by drag and drop between task fields. Task fields are programmed by visual "if-then" rules applying a combination of icon- and form-based techniques. When a document represented by an icon is dropped on a task field its rules are checked and actions of the selected rules are excited. VIP space is finally demonstrated in an Internet course application.}},
  author       = {{Dücker, M. and Müller, Wolfgang and Rubart, Jessica}},
  booktitle    = {{ Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences}},
  isbn         = {{0-7695-0001-3}},
  keywords     = {{Application software, Electronic mail, Computer networks, Collaborative work, Teleconferencing, Asynchronous communication, Software systems, Internet, Computer applications, Discussion forums}},
  location     = {{Maui, HI, USA }},
  title        = {{{Innovative Concepts for Configurating Shared Workspaces through Visual Programming}}},
  doi          = {{10.1109/HICSS.1999.773046}},
  year         = {{1999}},
}

@inproceedings{39474,
  abstract     = {{Agent-based systems technologies are of emerging interest in the specification and implementation of complex systems. This article introduces the CASA agent development system which seamlessly combines the BDI (belief desire intention) approach with the FIPA agent communication language standard and an integrated specification of fuzzy controllers. The behavior of agents is defined by strategies which basically correspond to extended guarded Horn clauses with priorities. The presented concepts are introduced by an example from computer integrated manufacturing (CIM). The example gives the specification of a fuzzy controller for a manufacturing station in the context of a holonic manufacturing system (HMS).}},
  author       = {{Flake, Stephan and Geiger, Christian and Lehrenfeld, G. and Müller, Wolfgang and Paelke, Volker}},
  booktitle    = {{Proceedings of NAFIPS'99, 18th International Conference of the North American Fuzzy Information Processing Society}},
  isbn         = {{0-7803-5211-4}},
  keywords     = {{Manufacturing systems, Fuzzy control, Multiagent systems, Control systems, Concurrent computing, Specification languages, Communication standards, Standards development, Communication system control, Computer integrated manufacturing}},
  location     = {{New York, NY, USA }},
  publisher    = {{IEEE}},
  title        = {{{Agent-Based Modeling for Holonic Manufacturing Systems with Fuzzy Control}}},
  doi          = {{10.1109/NAFIPS.1999.781697}},
  year         = {{1999}},
}

@inproceedings{39541,
  abstract     = {{We investigate a translation of SDL diagrams into the complete visual representation of Pictorial Janus (PJ) programs in order to analyze the specification by visual debugging and animation. We additionally introduce timing concepts to PJ (Timed PJ) for a mapping of the SDL timing statements. The concepts transforming SDL interaction and process diagrams into Timed PJ are outlined by an example sketching the transformation of an Ethernet CSMA/CD protocol specification.}},
  author       = {{Lehrenfeld, Georg and Müller, Wolfgang and Tahedl, C.}},
  booktitle    = {{Proceedings of Symposium on Visual Languages}},
  isbn         = {{0-8186-7045-2}},
  keywords     = {{Animation, Timing, Debugging, Ethernet networks, Multiaccess communication, Protocols, Computer languages, Prototypes, Environmental management, Visualization}},
  title        = {{{Transforming SDL Diagrams Into a Complete Visual Representation}}},
  doi          = {{10.1109/VL.1995.520803}},
  year         = {{1995}},
}