Die zunehmende IKT-Integration und neue Anforderungen der Produktionstechnik erhöhen die Komplexität der Automation zunehmend und führen zur Überforderung der Menschen mit damit einhergehender sinkender Arbeitseffektivität. Um dieser Situation zu begegnen hat die Bundesregierung das Thema Industrie 4.0 ins Leben gerufen, … Continue reading →
On behalf of the German Railway Authority (Eisenbahnbundesamt) the suitability of a parameter “Capacity of railway infrastructure” in the target and performance agreement (LuFV) between the federal government and Deutsche Bahn AG has been analyzed. Today the capacity of railway … Continue reading →
Benedikt Brütsch: “Synthesizing Structured Reactive Programs: How Much Memory Do They Need?”. Abstract: Existing approaches to the synthesis of controllers in reactive systems typically involve the construction of transition systems such as Mealy automata. In 2011, Madhusudan proposed structured programs … Continue reading →
Visit the Railway Signalling Lab (ELVA) of the Institute of Transport Science. “Synthesizing Structured Reactive Programs: How Much Memory Do They Need?”. The meeting point will be in the foyer of the building of civil engineering (Mies-van-der-Rohe-Straße 1) at 10.15 … Continue reading →
We consider the hardness of computing expected outcomes and almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a program equals a given rational value is $\Pi^0_2$-complete. Computing lower and upper … Continue reading →
Ibtissem Ben Makhlouf: Reachability Analysis of Hybrid Systems Using Geometric Approximations Hybrid systems combine discrete events and continuous behaviors in the same framework. The discrete part is represented as transitions between locations, in which the continuous part is described as … Continue reading →
Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs Separation Logic (SL) is an extension of Hoare Logic that supports reasoning about pointer-manipulating programs. It employs inductively-defined predicates for specifying the (dynamic) data structures maintained at runtime, such as … Continue reading →
Title: Online Independent Set Beyond the Worst-Case Abstract: We investigate online algorithms for maximum independent set on graph classes with bounded inductive independence number $\rho$ like interval and disk graphs with applications to, e.g., task scheduling, spectrum allocation and admission … Continue reading →
