Weighted Automata and Logics on Hierarchical Structures and Graphs

Formal language theory, originally developed to model and study our natural spoken languages, is nowadays also put to use in many other fields. These include, but are not limited to, the definition and visualization of programming languages and the examination and verification of algorithms and systems. Formal languages are instrumental in proving the correct behavior of automated systems, e.g., to avoid that a flight guidance system navigates two airplanes too close to each other. This vast field of applications is built upon a very well investigated and coherent theoretical basis. It is the goal of this dissertation to add to this theoretical foundation and to explore ways to make formal languages and their models more expressive. More specifically, we are interested in models that are able to model quantitative features of the behavior of systems. To this end, we define and characterize weighted automata over structures with hierarchical information and over graphs. In particular, we study infinite nested words, operator precedence languages, and finite and infinite graphs. We show Büchi-like results connecting weighted automata and weighted monadic second order (MSO) logic for the respective classes of weighted languages over these structures. As special cases, we obtain Büchi-type equivalence results known from the recent literature for weighted automata and weighted logics on words, trees, pictures, and nested words. Establishing such a general result for graphs has been an open problem for weighted logics for some time. We conjecture that our techniques can be applied to derive similar equivalence results in other contexts like traces, texts, and distributed systems

Disorder control in crystalline GeSb2Te4 and its impact on characteristic length scales

Crystalline GeSb2Te4 (GST) is remarkable material, as it allows to continuously tune the electrical resistance by orders of magnitude without involving a phase transition or stoichiometric changes, just by altering the short-range order. While well-ordered specimen are metallic, increasing amounts of disorder can eventually lead to an insulating state with vanishing conductivity in the 0K limit, but a similar number of charge carriers. These observations make disordered GST one of the most promising candidates for the realization of a true Anderson insulator. While so far the low-temperature properties have mostly been studied in films of small grain size, here a sputter-deposition process is employed that enables preparation of a large variety of these GST states including metallic and truly insulating ones. By growing films of GST on mica substrates, biaxially textured samples with huge grain sizes are obtained. A series of these samples is employed for transport measurements, as their electron mean free path can be altered by a factor of 20. Yet, the mean free path always remains more than an order of magnitude smaller than the lateral grain size. This proves unequivocally that grain boundaries play a negligible role for electron scattering, while intragrain scattering, presumably by disordered vacancies, dominates. Most importantly, these findings underline that the Anderson insulating state as well as the system's evolution towards metallic conductivity are indeed intrinsic properties of the material

Weighted Automata and Logics on Hierarchical Structures and Graphs

Formal language theory, originally developed to model and study our natural spoken languages, is nowadays also put to use in many other fields. These include, but are not limited to, the definition and visualization of programming languages and the examination and verification of algorithms and systems. Formal languages are instrumental in proving the correct behavior of automated systems, e.g., to avoid that a flight guidance system navigates two airplanes too close to each other. This vast field of applications is built upon a very well investigated and coherent theoretical basis. It is the goal of this dissertation to add to this theoretical foundation and to explore ways to make formal languages and their models more expressive. More specifically, we are interested in models that are able to model quantitative features of the behavior of systems. To this end, we define and characterize weighted automata over structures with hierarchical information and over graphs. In particular, we study infinite nested words, operator precedence languages, and finite and infinite graphs. We show Büchi-like results connecting weighted automata and weighted monadic second order (MSO) logic for the respective classes of weighted languages over these structures. As special cases, we obtain Büchi-type equivalence results known from the recent literature for weighted automata and weighted logics on words, trees, pictures, and nested words. Establishing such a general result for graphs has been an open problem for weighted logics for some time. We conjecture that our techniques can be applied to derive similar equivalence results in other contexts like traces, texts, and distributed systems

Weighted Automata and Logics on Hierarchical Structures and Graphs

Formal language theory, originally developed to model and study our natural spoken languages, is nowadays also put to use in many other fields. These include, but are not limited to, the definition and visualization of programming languages and the examination and verification of algorithms and systems. Formal languages are instrumental in proving the correct behavior of automated systems, e.g., to avoid that a flight guidance system navigates two airplanes too close to each other. This vast field of applications is built upon a very well investigated and coherent theoretical basis. It is the goal of this dissertation to add to this theoretical foundation and to explore ways to make formal languages and their models more expressive. More specifically, we are interested in models that are able to model quantitative features of the behavior of systems. To this end, we define and characterize weighted automata over structures with hierarchical information and over graphs. In particular, we study infinite nested words, operator precedence languages, and finite and infinite graphs. We show Büchi-like results connecting weighted automata and weighted monadic second order (MSO) logic for the respective classes of weighted languages over these structures. As special cases, we obtain Büchi-type equivalence results known from the recent literature for weighted automata and weighted logics on words, trees, pictures, and nested words. Establishing such a general result for graphs has been an open problem for weighted logics for some time. We conjecture that our techniques can be applied to derive similar equivalence results in other contexts like traces, texts, and distributed systems

Krankenhäuser in Bewegung

KRANKENHÄUSER IN BEWEGUNG Krankenhäuser in Bewegung / Dück, Julia (Rights reserved) ( -

Deterministic Transport Protocol Verified by a Real-Time Actuator and Sensor Network Simulation for Distributed Active Turbulent Flow Control

Total drag of common transport systems such as aircrafts or railways is primarily determined by friction drag. Reducing this drag at high Reynolds numbers (<104) is currently investigated using flow control based on transversal surface waves. For application in transportation systems with large surfaces a distributed real-time actuator and sensor network is in demand. To fulfill the requirement of real-time capability a deterministic transport protocol with a master slave strategy is introduced. With our network model implemented in Simulink using TrueTime toolbox the deterministic transport protocol could be verified. In the model the Master-Token-Slave (MTS) protocol is implemented between the application layer following the IEEE 1451.1 smart transducer interface standards and the Ethernet medium access protocol. The model obeys interfaces to the flow control and the DAQ-hardware allowing additional testing in model in the loop simulations

Ethernet based time synchronization for Raspberry Pi network improving network model verification for distributed active turbulent flow control

Friction drag primarily determines the total drag of transport systems. A promising approach to reduce drag at high Reynolds numbers (> 104) are active transversal surface waves in combination with passive methods like a riblet surface. For the application in transportation systems with large surfaces such as airplanes, ships or trains, a large scale distributed real-time actuator and sensor network is required. This network is responsible for providing connections between a global flow control and distributed actuators and sensors. For the development of this network we established at first a small scale network model based on Simulink and TrueTime. To determine timescales for network events on different package sizes we set up a Raspberry Pi based testbed as a physical representation of our first model. These timescales are reduced to time differences between the deterministic network events to verify the behavior of our model. Experimental results were improved by synchronizing the testbed with sufficient precision. With this approach we assure a link between the large scale model and the later constructed microcontroller based real-time actuator and sensor network for distributed active turbulent flow control

Development of a real time actuation control in a network-simulation framework for active drag reduction in turbulent flow

Active drag reduction in high Reynolds numbers (<10^4) by span-wise transversal surface waves is a promising approach to gain less energy consumption and less pollution in air transportation. The development of robust methods for this flow control is based on numerical studies and wind tunnel experiments. In final application, flow control is expected to be performed by real time actuator and sensor networks. In a first step a SIMULINK model of the network is developed which is also used to drive wind tunnel experiments for parameter studies and testing of control algorithms. In this paper we focus on the LabView based interface to the actuating and sensing hardware enabling continuous changes of actuating parameters in real time. This implementation already allows for extensive and efficient experimental wind tunnel studies