Oberseminar "Theoretische Informatik"

Das Oberseminar "Theoretische Informatik" wird gemeinsam von den Fachgebieten "Theoretische Informatik" (Prof. Otto) und "Theoretische Informatik/Formale Methoden" (Prof. Lange) durchgeführt. In diesem Seminar tragen Mitarbeiter, interessierte Studenten und Gäste über aktuelle Forschungsarbeiten im Bereich der theoretischen Informatik vor.


Mittwoch, 29.03.2016: Arno Ehle

Automatisierte Beweise im Sequenzenkalkül-Trainer

The presentation "Automated Proof Search for the Sequent Calculus Trainer" summarizes the results of the Master Thesis „Proof Search in the Sequent Calculus for First-Order Logic with Equality“ by Arno Ehle. The Sequent Calculus Trainer is a program, that is designed to support students in studying the sequent calculus.  As an introduction, we will shortly demonstrate the Sequent Calculus Trainer, the feature set of it in the past and what was still missing to support student even better. The main part of the presentation is about the automated proof search. We will discuss the most important problems for doing automated proof search in the sequent calculus and show some solutions used in the master thesis. The last part is a live demonstration of the Sequent Calculus Trainer, where we present the new features that are base on the results of the master thesis.


Freitag, 24.02.2016: Thao Nguyen

Formal verification of mobile robot protocols

Mobile robot networks emerged in the past few years as a promising distributed computing model. Existing work in the literature typically ensures the correctness of mobile robot protocols via ad hoc handwritten proofs, which, in the case of asynchronous execution models, are both cumbersome and error-prone. The authors propose a formal model to describe mobile robot protocols operating in a discrete space i.e., with a finite set of possible robot positions, under synchronous and asynchronous assumptions. The authors translate this formal model into the DVE language, which is the input format of the model-checkers DiVinE and ITS tools, and formally prove the equivalence of the two models. They then verify several instances of two existing protocols for variants of the ring exploration in an asynchronous setting: exploration with stop and perpetual exclusive exploration. For the first protocol they refine the correctness bounds and for the second one they exhibit a counterexample. For the second one, I also use the UPPAAL model checking tool to re-verify.


Freitag, 04.11.2016: Kent Kwee

Ordered Restarting Automata: The Benefit of Patterns

While (stateless) deterministic ordered restarting automata accept exactly the regular languages, it is known that nondeterministic ordered restarting automata accept some languages that are not even growing context-sensitive.
In fact, the class of languages accepted by these automata is an abstract family of languages that is incomparable to the (deterministic) linear languages, the (deterministic) context-free languages, and the growing context-sensitive languages with respect to inclusion, and the emptiness problem is decidable for these automata. These results were derived using a Cut-and-Paste Lemma for nondeterministic ordered restarting automata that is based on Higman's theorem.
Here we extend the arguments used in that proof and introduce a new approach to actually derive a real Pumping Lemma for these automata. Based on this Pumping Lemma we then prove that the finiteness problem is also decidable for these automata, and that the only unary languages these automata accept are the regular ones.
Finally, we present a new and simplified proof for the fact that stateless ordered restarting automata only accept regular languages.


Freitag, 15.07.2016: Daniel Kernberger

Model Checking for the Full Hybrid Computation Tree Logic

We consider the hybridisations of the full branching time logic CTL∗ through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining complexities from PSPACE-completeness to non-elementary decidability.


Freitag, 08.07.2016: Qichao Wang

Weighted Restarting Automata as Language Acceptors

We use weighted restarting automata to define classes of formal languages by combining the acceptance condition of a restarting automaton with a condition on the weight of its accepting computations.
Specifically, we consider the tropical semiring and the semiring of regular languages over some finite alphabet. We show that by using the tropical semiring, we can avoid the use of auxiliary symbols.
Further, a certain type of (word-)weighted restarting automata turns out to be equivalent to non-forgetting restarting automata, and another class of languages accepted by (word-)weighted restarting automata is shown to be closed under intersection.


Freitag, 01.07.2016: Kent Kwee

Ordered RRWW-Automata

It is known that the deterministic ordered restarting automaton accepts exactly the regular languages, while its nondeterministic variant accepts some languages that are not even growing context-sensitive.
Here we study an extension of the ordered restarting automaton, the so-called ORRWW-automaton, which is obtained from the previous model by separating the restart operation from the rewrite operation.
First we show that the deterministic ORRWW-automaton still characterizes just the regular languages. Then we prove that this also holds for the stateless variant of the nondeterministic ORRWW-automaton, which is obtained by splitting the transition relation into two parts, where the first part is used until a rewrite operation is performed, and the second part is used thereafter. Finally, we show that the nondeterministic ORRWW-automaton is even more expressive than the nondeterministic ordered restarting automaton.


Freitag, 17.06.2016: Milka Hutagalung

Buffered Simulation Games

We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers before she executes them on her structure. We show that they are useful to approximate the inclusion of trace closures of languages accepted by finite-state automata, which is known to be undecidable. We study the decidability and complexity and show that the game with bounded buffers can be decided in polynomial time, whereas the game with one unbounded and one bounded buffer is highly undecidable. If time permits, we also give a topological characterisation of the games using the notion of continuous and Lipschitz continuous function.


Freitag, 03.06.2016: Florian Bruse

Alternating Krivine Automata

Alternating Parity Krivine Automata (APKA) provide operative semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinary parity automata extended by a variation of the Krivine Abstract Machine. We study their construction and show how any HFL-formula can be converted into an APKA. Time permitting, we also sketch hoe the number and parity of priorities available to an APKA form a proper hierarchy of expressive power as in the modal µ-calculus, which also induces a strict alternation hierarchy on HFL.


Freitag, 15.04.2016: Martin Lange

Higher-Order Fixpoint Logic

Higher-Order Fixpoint Logic (HFL) is an extension of the modal mu-calculus by higher-order features, syntactically represented using a simply typed lambda calculus. Its formulas of order 0 form the modal mu-calculus and express properties of states in a transition system, i.e. predicates. Its formulas of order 1 express predicate transformers, i.e. mappings from predicates to predicates. Monotone predicate transformers form a complete lattice over any transition systems, thus a denotational semantics for fixpoint formulas over predicate transformers can be given. This principle easily extends to functions of higher order.
We will introduce the syntax and semantics of HFL and give some examples of properies expressible in HFL (but not in the mu-calculus) thus trying to give some intuition on how such formulas can be read and understood. We will survey some results known about the expressive power and complexity of HFL, most importantly that the model checking problem for the order-k fragment is complete for k-EXPTIME.

Freitag, 27.11.2015: Martin Lange

LTL with Past: Expressiveness and Succinctness

We consider the linear-time temporal logic LTL enriched with temporal operators for the past, for example "since", "always in the past", "yesterday" etc. A natural question concerns its expressive power compared to future-only LTL (which is known to be equi-expressive to first-order logic or star-free languages). We present Gabbay's Separation Theorem from which equi-expressiveness between LTL and LTL+Past on infinite words follows immediately.
The next question that arises with equi-expressive languages is that of succinctness: Gabbay's Separation Theorem gives a computable tranformation of formulas of LTL+Past to LTL which incurs a non-elementary blow-up. This indicates that some properties can be expressed more succinctly in LTL+Past than in LTL. On the other hand, it is known that satisfiability for both is just PSPACE-complete (which indicates that such a succinctness gap is, if it exists, not straight-forward to show). We then present a clever argument by Laroussinie/Markey/Schnoebelen who proved the existence of an exponential succinctness gap between LTL+Past and LTL.


Donnerstag, 17.11.2015: Jörg Kreiker

Java Generics


Donnerstag, 18.06.2015: Maxime Folschette

Some Methods and Results on Biological Regulatory Networks

Biological Regulatory Networks (BRNs) are a wide class of qualitative models used to represent biological processes. Since their formalization (Kauffman, 1969 & Thomas, 1973) some interesting methods have emerged, leading to well-known results in this domain. During this seminar, I will present some of the main results discovered on these models, while gradually focusing on my field of research, related to the use of formal methods to study the dynamics of BRNs.


Donnerstag, 11.06.2015: Kent Kwee

On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata

Stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential.
Here we show that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent unambiguous NFA is exponential, which yields an upper bound of $2^{2^{O(n)}}$ for the conversion into an equivalent DFA, thus meeting the lower bound up to a constant. Based on the new transformation we then show that many decision problems, such as emptiness, finiteness, inclusion, and equivalence, are PSPACE-complete for stateless deterministic ordered restarting automata.


Mittwoch, 28.05.2015: Norbert Hundeshagen

Sequent Calculus Trainer

We present the Sequent Calculus Trainer, a tool that supports students in learning how to correctly construct proofs in the sequent calculus for first-order logic with equality. It is a proof assistant fostering the understanding of all the syntactic principles that need to be obeyed In constructing correct proofs.
We also report on some empirical findings that indicate how the Sequent Calculus Trainer can improve the students' success in learning sequent calculus for full first-order logic.


Mittwoch, 29.04.2015: Arno Ehle

Parity Games

Dieser Vortag befasst sich mit Algorithmen für Paritätsspiele auf Basis partieller Reduktionen auf Büchi-Spiele. Dabei bezieht sich der Begriff partiell zum einen darauf, wie viele Informationen aus der Lösung eines Büchi-Spiels gewonnen werden können und zum anderen auf das Prinzip der Reduktion an sich. Diesbezüglich werden drei verschiedene Ansätze erläutert. Der erste Ansatz ermöglicht eine partielle Reduktion auf Büchi-Spiele durch das Ausrollen von Zyklen in Teilspielen, wodurch jeweils ein neues Spiel erzeugt wird, das eine Priorität weniger besitzt. Der zweite und dritte Ansatz erweitern den Büchi-Algorithmus um rekursive Aufrufe auf echt kleineren Teilspielen und lösen durch mehrfaches Aufrufen dieses erweiterten Büchi-Algorithmus das eigentliche Paritätsspiel. Alle Algorithmen wurden in dem Projekt PGSolver implementiert und auf verschiedenen Spiele-Familien miteinander verglichen.


Mittwoch, 22.04.2015: Martin Lange

Language Inclusion

Deciding language inclusion between finite or Büchi automata is PSPACE-complete and therefore too complex for some practical purposes. One approach to circumvent the high complexity is to use simulation instead. It approximates language inclusion in the sense that simulation implies it but not vice-versa. On the other hand, simulation between finite or Büchi automata can be computed in polynomial (e.g. quadratic) time. Hence, simulation offers a decent alternative approach to solving language inclusion by trading in precision for efficiency.
In this talk we consider the case for a larger class of automata, namely visibly pushdown automata. Note that language inclusion is undecidable or pushdown automata but EXPTIME-complete for visibly pushdown automata. We show that here the situation is dramatically different: simulation is of course still just an approximation to language inclusion; however, it is also EXPTIME-complete.
This is joint work with Milka and Etienne.


Mittwoch, 11.02.2015: Martin Lange

Model Checking for String Problems

Model checking is a successful technique for automatic program verification. We show that it also has the power to yield competitive solutions for other problems. We consider three computation problems on strings and show how the polyadic modal μ-calculus can define their solutions. We use partial evaluation on a model checking algorithm in order to obtain an efficient algorithm for the longest common substring problem. It shows good performance in practice comparable to the well-known suffix tree algorithm. Moreover, it has the conceptual advantage that it can be interrupted at any time and still deliver long common substrings.


Mittwoch, 04.02.2015: Nobert Hundeshagen

A Hierarchy of Transducing Observer Systems

We mainly investigate the power of weight-reducing string-rewriting systems in the context of transducing observer systems. First we relate them to a special type of restarting transducer. Then we situate them between painter and length-reducing systems. Further we show that for every weight-reducing system there is an equivalent one that uses only weight-reducing painter rules. This result enables us to prove that the class of relations that is computed by transducing observer systems with weight-reducing rules is closed under intersection.

Mittwoch, 28.01.2015: Arno Ehle

Model Checker

In dem Vortrag wird das Projekt "Model Checker" vorgestellt, wobei Bezug auf die Aufgabenstellung, die Umsetzung und die Ergebnisse genommen wird. Das Programm "Model Checker" bietet die Möglichkeit interaktiv den Zusammenhang zwischen Formeln der Prädikatenlogik erster Stufe und deren Interpretationen zu erlernen bzw. zu vertiefen. In den Vortag integriert ist eine Live-Demo, die die Anregungen des Hörerkreises miteinbeziehen kann.


Mittwoch, 14.01.2015: Florian Bruse

The Canonical Model Technique for Modal Logic

Canonical models are a standard technique to establish completeness of a proof calculus for a modal logic. Successful construction of a canonical model implies compactness of the logic in question. We have a look at the technique for basic modal logic and how it has to be extended for some extensions, e.g., a fragment of PDL with intersection. If there is time, we also look how a similar technique works for non-compact logics.


Mittwoch, 17.12.2014: Kent Kwee

On the Number of Roots of a Polynomial of Spanning Trees of a Graph

In this talk we introduce a polynomial associated to graphs and determine the number of roots over F_q. M. Kontsevich conjectured that this number is a polynomial in q, i.e. a polynomial in q independent of the characteristic p of the field F_q. This conjecture is wrong and we will present several methods for determining this number to see in which case it is a polynomial and in which it is not.


Mittwoch, 10.12.2014: Maxime Folschette

Process Hitting

The representation and analysis of biological regulatory networks can be tackled with formal methods. My work focuses on the use and enrichment of the expressivity of the Process Hitting, a recently introduced formalism that allows to study large models (up to hundreds of components). This framework especially comes with an efficient reachability analysis which avoids the usual combinatorial explosion of the state graph computation.


Mittwoch, 26.11.2014: Martin Lange

The strictness of the mu-calculus alternation hierarchy over the class of all structures

In this last talk on the modal mu-calculus we will show that the alternation hierarchy is in general strict, i.e. more fixpoint alternation yields more expressive power. Remember that on some classes of structures like finite or infinite words for example this is not the case.
The result was first established by Bradfield in 1996, and also independently by Lenzi in that year as well. The proof presented in this seminar is Arnold's - particularly nice one - from 1999 using Banach's Fixpoint Theorem. So most of the seminar will be spent talking about basic topology, namely complete metric spaces etc. The actual proof of the alternation hierarchy is then a simple diagonalisation argument using the Fixpoint Theorem and the Walukiewicz formulas that express whether or not an arbitrary mu-calculus formula of bounded alternation holds on a given structure.


Mittwoch, 19.11.2014: Stéphane Demri

Verification of Linear-Time Properties on Flat Counter Systems

Flat counter systems are integer programs in which the control graph satisfies the so-called flatness condition. Even though in full generality, the verification of integer programs is well-known to be undecidable (even for simple properties) in this talk we show that the model-checking  problem for flat counter systems with Past LTL and arithmetical contraints on counters is NP-complete.
The proof technique to get the NP upper bound takes advantage of a stuttering theorem for (plain) Past LTL as well as properties about small integer solutions  for  quantifier-free Presburger formulae.
In time permits, results for extensions of LTL such as ETL, linear mu-calculus or CTL* shall be also discussed.
The talk is based on joint works with Amit Kumar Dhar and Arnaud Sangnier.

Mittwoch, 12.11.2014: Martin Lange

The collapse of the mu-calculus alternation hierarchy on certain classes of structures

The goal of this little series on talks about the modal mu-calculus is to understand the phenomenon of fixpoint alternation. In this talk we will show that the alternation hierarchy collapses on certain classes of structures, namely those with no infinite paths and words. I.e. every formula is equivalent over such structures to one with "very little" fixpoint alternation.
The main motivation for such results is drawn from the two facts that fixpoint alternation
- makes it difficult to understand the properties expressed by formulas, and
- mainly determines the complexity of model checking: the currently best
algorithms are polynomial in the size of the structure and formula but exponential in its alternation depth.

Mittwoch, 05.11.2014: Florian Bruse

The Fixpoint-Iteration Algorithm for Parity Games

It is known that the model checking problem for the modal μ-calculus reduces to the problem of solving a parity game and vice-versa. The latter is realised by the Walukiewicz formulas which are satisfied by a node in a parity game iff player 0 wins the game from this node. Thus, they define her winning region, and any model checking algorithm for the modal μ-calculus, suitably specialised to the Walukiewicz formulas, yields an algorithm for solving parity games. We study the effect of employing the most straight-forward μ-calculus model checking algorithm: fixpoint iteration. This is also one of the few algorithms, if not the only one, that were not originally devised for parity game solving already. While an empirical study quickly shows that this does not yield an algorithm that works well in practice, it is interesting from a theoretical point for two reasons: first, it is exponential on virtually all families of games that were designed as lower bounds for very particular algorithms suggesting that fixpoint iteration is connected to all those. Second, fixpoint iteration does not compute positional winning strategies. Note that the Walukiewicz formulas only define winning regions; some additional work is needed in order to make this algorithm compute winning strategies. We show that these are particular exponential-space strategies which we call eventually-positional, and we show how positional ones can be extracted from them.


Mittwoch, 29.10.2014: Martin Lange

Introduction to the Modal Mu-Calculus

No Abstract


Freitag, 12.09.2014 um 14:00 Uhr: David Kronenberger

Comparing two different classes of deterministic recognizable picture languages

In this talk we compare two different definitions of deterministic recognizable picture languages. Furthermore, we examine closure properties of the corresponding classes of languages. The first definition of deterministic recognizable picture languages uses a domino tiling system to recognize a local picture by a deterministic process. The family of all languages that recognizes a picture in that way is abbreviated with DREC.
The second and completely different definition uses a tiling system to recognize a picture by proceeding from one corner to the diagonally opposite corner. Because of its procedure the class of all these languages are abbreviated with Diag-DREC. We show that Diag-DREC is not closed under intersection and union and DREC is closed under rotation and intersection. Furthermore, we show that the family of all two-dimensional deterministic online tesselation automata is a subset of DREC. Knowing that Diag-DREC is equal to the closure by rotation of the family of all two-dimensional deterministic online tesselation automata, we show that Diag-DREC is a proper subset of DREC.


Mittwoch, 25.06.2014 um 10:00 Uhr: Etienne Lozes, Uni Kassel

Capturing Bisimulation - Invariant Complexity Classes with Higher-Order Fixpoint Logic.

We consider Polyadic Higher-Order Fixpoint Logic (PHFL), a modal fixpoint logic that is obtained as the merger of Higher-Order Fixpoint Logic and the Polyadic $\mu$-Calculus, two formalisms which were originally introduced as expressive languages for program specification purposes. Polyadicity enables formulas to make assertions about tuples of states rather than states only. From Higher-Order Fixpoint Logic, PHFL inherits the ability to formalise properties using higher-order functions.

We consider PHFL in the setting of descriptive complexity theory: its fragment using no functions of higher-order is exactly the Polyadic $\mu$-Calculus, and it is known from Otto's Theorem that it captures the bisimulation-invariant fragment of the complexity class P. We extend this result by showing that certain other fragments of PHFL capture the bisimulation-invariant fragments of other important complexity classes. We first show that EXPTIME in this sense is captured by the fragment using at most functions of order 1. We also give characterisations of PSPACE and NLOGSPACE by certain formulas of these two fragments which can be regarded as having tail-recursive functions only.

While many characterisations of complexity classes in descriptive complexity theory have been obtained as extensions of logics with low expressive power, the work we present here introduces a logic of very high expressive power and characterises complexity classes by fragments of this generic framework.


Mittwoch, 04.06.2014 um 05:00 Uhr: Thorsten Löbig

Untersuchung zur Anwendbarkeit von Formalen Methoden am Beispiel einer Infusionspumpe.

Model Checking ermöglicht es formal nachzuweisen, ob ein System ein Modell einer gegebenen Spezifikation ist. Es ist damit auch potentiell möglich, die Abwesenheit von bestimmten Fehlerklassen zu zeigen.
Techniken aus diesem Gebiet haben bisher jedoch kaum Eingang in die moderne Softwareentwicklung gefunden. Die Hauptgründe hierfür sind das "State-space explosion" Problem und das nötige Expertenwissen, um diese Werkzeuge effektiv einsetzen zu können.
In meiner Bachelor Arbeit habe ich die Anwendbarkeit von heute verfügbaren Model Checkern im Rahmen eines realen Software-Großprojekts (Software einer Infusionspumpe) untersucht. In dem Vortrag stelle ich die Ergebnisse meiner Arbeit vor und demonstriere die Möglichkeiten und Limitationen der untersuchten Model Checker mit anschaulichen Anwendungsbeispielen.


Mittwoch, 14.05.2014 um 10:00 Uhr: Richard Petersen, Uni Kassel

Growing Context-Sensitive Matrix Grammars

In the thesis, the matrix languages introduced by the Sironmoney's, are combined with the growing context-sensitive languages. We call this new class of picture languages the class of growing context-sensitive matrix languages. Furthermore, we examine some closure properties and we find out that the class of growing context-sensitive matrix languages is closed under union, column concatenation, column closure, column-morphism, inverse morphism and intersection with regular matrix languages. Thus, this class is an abstract family of matrices.


Mittwoch, 07.05.2014 um 10:00 Uhr: Etienne Lozes, Uni Kassel

Buffered Simulation Games for Büchi Automata

Simulation relations are an important tool in automata theory because they provide  efficiently computable approximations to language inclusion. In recent years, extensions of ordinary simulations have been studied, for instance multi-pebble and multi-letter simulations which yield better approximations and are still polynomial-time  computable.
In this paper we study the limitations of approximating language inclusion in this way: we introduce a natural extension of multi-letter simulations called buffered simulations. They are based on a simulation game in which the two players share a FIFO buffer of unbounded size.  We consider two variants of these buffered games called continuous and look-ahead simulation which differ in how elements can be removed from the FIFO buffer. We show that look-ahead simulation, the simpler one, is already PSPACE-hard, i.e. computationally as hard as language inclusion itself. Continuous simulation is even EXPTIME-hard. We also provide matching upper bounds for solving these games with infinite state spaces.


Mittwoch, 30.04.2014 um 10:00 Uhr: Qichao Wang, M.Sc., Uni Kassel

Weighted Restarting Automata

Restarting automata have been introduced to model the linguistic technique of analysis by reduction, which is used for checking the correctness of a sentence of a natural language. In order to study quantitative aspects of restarting automata, we introduce the concept of a weighted restarting automaton. By looking at different semirings and different weight functions, various quantitative aspects of the behavior of restarting automata can be studied. In this presentation I describe the weighted restarting automaton in detail, present some examples, and state a few preliminary results on properties of weighted restarting automata.


Montag, 24.3.2013 um 10:00 Uhr: Daniel Kernberger, Uni Kassel

Weak alternating automata are not that weak

Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata induce different levels of expressive power, of succinctness, and of complexity. Alternating automata have both existential and universal branching modes and are particularly suitable for specification of programs. In a weak alternating automata the state space is partitioned into partially ordered sets, and the automaton can proceed from a certain set only to smaller sets. Reasoning about weak alternating automata is easier than reasoning about alternating automata with no restricted structure. Known translations of alternating automata to weak alternating automata involve determinization, and therefore involve a double-exponential blow-up. In this paper we describe a quadratic translation, which circumvents the need for determinization, of Büchi and co-Büchi alternating automata to weak alternating automata. Beyond the independent interest of such a translation, it gives rise to a simple complementation algorithm for nondeterministic Büchi automata.


Mittwoch, 20.11.2013 um 10:00 Uhr: Dr. Rüdiger Ehlers, Uni Kassel

Synthesis with Identifiers

We consider the synthesis of reactive systems from specifications with identifiers. Identifiers are useful to parametrize the input and output of a reactive system, e.g., to state which client requests a grant from an arbiter, or the type of object that a robot is expected to fetch.
Traditional reactive synthesis algorithms only handle a constant bounded range of such identifiers, although in practice, we might not want to restrict the number of clients of an arbiter or the set of object types handled by a robot a-priori. We first present a concise automata-based formalism for specifications with identifiers. The synthesis problem for such specifications is undecidable. We therefore give an algorithm that is always sound, and complete for unrealizable safety specifications.
Our algorithm is based on computing a pattern-based abstraction of a synthesis game that captures the realizability problem for the specification. The abstraction does not restrict the possible solutions to finite-state ones and captures the obligations for the system in the synthesis game. We present an experimental evaluation based on a prototype implementation that shows the practical applicability of our algorithm.


Montag, 14.10.2013: John McCabe-Dansted (University of Western Australia)

Model Checking for Compositional Models of General Linear Time

We address the problem of model checking temporal formulas with Until and Since over general linear time. General linear time allows us to capture continuous properties in applications such as distributed systems, natural language, message passing and AI modelling of human reasoning. Models are represented using a recently formalised compositional language. This language is closely related to a tableau method for general linear time. Given a model described in our model expression language and a temporal logic formula, the algorithm decides whether the formula is satisfied in the model. Like Linear Temporal Logic (LTL), the problem is PSPACE-complete and the time required is linear in the length of the model. We motivate this result by examining how some Zeno properties can be model checked, such as for a system that needs to interact with a Zeno environment.


Mittwoch, 9.10.2013: John McCabe-Dansted (University of Western Australia)

Algorithms and Temporal Logics

Dr John McCabe-Dansted will present an overview of his work on logics for branching time and general linear flows of times. His thesis was on RoCTL*, and extension to the common branching time logic CTL* for reasoning about robustness. RoCTL* is no more expressive than CTL* but is shown to be exponentially succinct. Recent work has been on decision tableau for a weaker logics including BCTL* and Non-Local BCTL*.
The Non-Local tableau is used in ongoing work on automatic verification of rewrite rules with sample applications for crowd-sourcing and automatically generating rewrite rules. Other ongoing research includes a model checker of a recently specified language for expressing models for any satisfiable Real Temporal Logic formula, and potential extensions to Metric Temporal Logic.


Mittwoch, 3.7.2013: Michael Falk und Etienne Lozes

Michael Falk: Fixpunkt-Iteration für das Lösen von Paritätsspielen

In diesem Vortrag werden die Ergebnisse der gleichnamigen Bachelor-Arbeit präsentiert.

Etienne Lozes: On Decision Problems for Probabilistic Büchi Automata

This will be a talk based on the slides of Nathalie Bertrand. people.rennes.inria.fr/Nathalie.Bertrand/pba-lsv.pdf. I will try to understand most of that and present it. In short, Probabilistic Büchi Automata are Büchi automata where the non-determinism is replaced by a random choice. An infinite word defines thus a random infinite run. The word is accepted if the probability p that the infinite run is accepting is >0 (or =1, in some variants). We'll see how the class of definable languages compares to Büchi automata and which decision problems are decidable for this automaton model.


Mittwoch, 27.03.2013, 11:30 Uhr, Raum WA1318:  Milka Hutagalung (Uni Kassel)

Revealing vs. Concealing: More Simulation Games for Büchi Inclusion

We address the problem of deciding language inclusion between two non-deterministic Büchi automata. It is known to be PSPACE- complete and finding techniques that are efficient in practice is still a challenging problem. We introduce two new sequences of simulation relations, called multi-letter simulations, in which Verifier has to reproduce Refuter’s moves taking advantage of a forecast. We compare these with the multi-pebble games introduced by Etessami. We show that multi- letter simulations, despite being more restrictive than multi-pebble ones, have a greater potential for an incremental inclusion test, for their size grows generally slower. We evaluate this idea experimentally and show that incremental inclusion testing may outperform the most advanced Ramsey-based algorithms by two orders of magnitude.This is a joint work with Martin Lange and Etienne Loze.


Mittwoch, 06.03.2013, 11:00 Uhr, Raum WA1318:  Manuel Vargas Guzmán (Uni Kassel)

Model-Checking Process Equivalences.

Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude of formal process equivalences, ranging from bisimulation to trace equivalence, categorised in the linear-time branching-time spectrum. We present a logical framework based on an expressive modal fixpoint logic which is capable of defining many process equivalence relations: for each such equivalence there is a fixed formula which is satisfied by a pair of processes if and only if they are equivalent with respect to this relation. We explain how to do model checking, even symbolically, for a significant fragment of this logic that captures many process equivalences. This allows model checking technology to be used for process equivalence checking. We show how partial evaluation can be used to obtain decision procedures for process equivalences from the generic model checking scheme. This is the work of two papers, a conference and an extended version, written together with Martin Lange, Etienne Lozes and myself.


Mittwoch, 23.01.2013, 11:00 Uhr, Raum WA1318: Bahareh Badban (Uni Kassel)

Three-valued Abstraction-Refinement for Real-Time Systems.

The modeling of many real-life systems require dense time domains to reflect the fact that events may happen arbitrarily close to each other in actual applications. Timed automata have emerged for modeling such systems.  It is our goal to improve scalability of real-time model checking through the development of a CEGAR-based framework based on three-valued logic.  In general CEGAR indicates iterative refinement of over-approximated models based on the analysis of counterexamples until no more counterexamples can be found. Our aim is to develop a completely automatic predicate abstraction method for the verification of concurrent dense real-time systems. The idea of abstraction is to reduce dense timed automata into finite tractable size automata. With the intention of increasing the scalability of existing techniques, we have started to develop an algorithm which strengthens the automaton through discovering new hidden state invariants.  A particular challenge lies in integrating various forms of inter-process communications into out algorithms. In a joint work with Martin Lange, we have extended the initial results further into a research proposal.


Mittwoch, 14.11.2012, 11:00 Uhr, Raum WA1318: Martin Lange (Uni Kassel)

Branching Time? Pruning Time!

The full branching time logic CTL* is a well-known specification logic for reactive systems. Its satisfiability and model checking problems are well understood. However, it is still lacking a satisfactory sound and complete axiomatisation. The only proof system known for CTL* is Reynolds' which comes with an intricate and long completeness proof and, most of all, uses rules that do not possess the subformula property.
We consider a large fragment of CTL* which is characterised by disallowing certain nestings of temporal operators inside universal path quantifiers. This subsumes CTL+ for instance. We present infinite satisfiability games for this fragment. Winning strategies for one of the players represent infinite tree models for satisfiable formulas. These can be pruned into finite trees using fixpoint strengthening and some simple combinatorial machinery such that the results represent proofs in a Hilbert-style axiom system for this fragment. Completeness of this axiomatisation is a simple consequence of soundness of the satisfiability games. (Joint work with Markus Latte.)


Mittwoch, 11.7.2012, 11:00 Uhr, Raum WA1318: Bahareh Badban (Uni Kassel)

A Reduction System for Creating Semi-linear Parikh Images of Regular Expressions.

In this talk I will present a reduction system for regular expressions. The reduction system works like this: for any regular expression regex, it creates a semi-linear representation of the Parikh image of the language of regex. We prove that the reduction system always terminates in a state where the resulting most-reduced expression readily yields this semi-linear representation.


Mittwoch, 20.6.2012, 11:00 Uhr, Raum WA1318: Etienne Lozes (Uni Kassel)

Separation Logic .

Part Two : Expressivity and Complexity. In this talk, we'll introduce several decision problems with regard to separation logic, and show how a solution to them is helpful for verifying heap-manipulating programs with more or less amount of automation. While discussing these problems, it will be interesting to consider expressiveness issues, and to look at the extension of Separation Logic to arbitrary graph, called Spatial Logic for Graphs. We'll try to give a complete overview of the results, in particular connections with (monadic) second-order logic, and explain which decision procedures are used in existing tools.


Mittwoch, 13.6.2012, 11:00 Uhr, Raum WA1318: Etienne Lozes (Uni Kassel)

Separation Logic .

Hoare-Floyd logic is a well-known proof system for programs based on so-called Hoare triples of the form {A} p {B}, meaning "if program p can assume A as it starts, it ensures B as it stops". Separation Logic is an extension of Hoare-Floyd logic for reasoning about programs. The main ingredient of separation logic is a second-order connective called separating conjunction: A*B asserts that the state is composed of two disjoint parts, one satisfying A, the other satisfying B. This connective yields a new reading of a Hoare triple {A} p {B}: "if p can consume A as it starts, then it has enough resources to run safely, and it produces B as it stops". Less than ten years after its theoretical foundation, Separation Logic starts to prove, through impressive automatic tools, to be a successful approach for checking large low-level C code (Apache, Linux,...), and to nicely handle lots of small but intricate concurrent algorithms (e.g. lock-free concurrent data structures). The logical foundations, expressiveness issues, and decision procedures, have been much clarified since 2000. However, for all of these aspects and others, Separation Logic is still a very active field of research.
Part One : Foundations.  In this talk, we'll introduce the general problem of the verification of heap-manipulating programs, we will define a simple programming language and the core of separation logic's proof system. We'll illustrate it on several examples of standard but subtle algorithms for recursive data structures, with often a great gain of conciseness and readability with respect to other formalisms. We'll discuss semantics issues, so as ways of formally proving that a well-proved program has some nice properties.


Mittwoch, 30.5.2012, 11:30 Uhr, Raum WA1318: Waled Almakhawi (Uni Freiburg / Hodeidah Uni, Yemen)

Landmarks into Directed Model Checking.

Model checking considers the task to check if a given system description satises a given property. In case of erroneous systems, a counterexample is returned. Numerous studies have been done to nd ecient techniques that can nd error states in the system model state space in an ecient manner. Large system models have a huge number of states in their state space such that it is very costly to enumerate the entire state space. Therefore, it is highly required to find guidance informations that can tackle the problem of large state spaces. Directed model checking uses methods that can direct the search process towards error states. It uses the notion of heuristic functions to nd the way in which the states should be ordered during the state space traversal to nd an error state fast. In this thesis, we introduce the notion of landmarks to directed model checking. Landmarks have been originally introduced in AI planning. They provide additional information's that can be integrated beside the heuristic function. Landmarks are specific formula that must be achieved on the way to every error state. We will show how landmarks can be extracted and ordered, and how we can use these orderings to foster up the search and to recommend the model checker what is better to take in the next step to go towards the error state. We have implemented our approach into the mcta model checker. Our experiments show that sometimes performance improvements can be obtained.


Mittwoch, 2.5.2012, 11:00 Uhr, Raum WA1318: Martin Lange (Uni Kassel)

Parity Games: Theory, Practice, Applications

Parity games are 2-player games played on a (usually finite) directed graph in which each node has a priority. The winner of an infinite play is determined by the parity of the maximal priority occurring infinitely often in the play. This seemingly arbitrary concept captures all sorts of other winning conditions, namely all that can be expressed as an omega-regular set of plays. It also comes with nice algorithmic properties as well as a rich theory, even though the exact computational complexity of the solving problem for parity games remains unknown to date. In this talk I will start by giving an overview of the state-of-the- art in the theory of parity games and explain why the problem of solving such games lies at the heart of many problems in the area of formal methods, most notably satisfiability checking and program synthesis problems. I will also present PGSolver - a tool that aims at solving parity games efficiently in practice - and show some (surprising?) discrepancies between its behaviour in practice and theoretical predictions. I will conclude with on overview of potential further work in the area of parity game solving with a particular focus on applications of a certain extension of parity games, namely stair-parity games.


Mittwoch, 8.2.2012, 14:00 Uhr, Raum WA1318: Norbert Hundeshagen (Uni Kassel)

Characterizing the Rational Functions by Restarting Transducers

The rational relations are the well known class of relations that are defined as the rational subsets of the product of two monoids. This talk focusses on a proper subset of these relations, the rational functions. Here we characterize these functions and some of their proper subclasses by certain types of deterministic restarting transducers with window size one. Thereby a restarting transducer is a restarting automaton that is equipped with an output function.


Mittwoch, 1.2.2012, 14:00 Uhr, Raum WA1318: Friedrich Otto (Uni Kassel)

On Centralized PC Grammar Systems with Context-Sensitive Components

It is known that in returning mode centralized PC grammar systems with context-sensitive components only generate context-sensitive languages. In the literature it is claimed that this result extends to centralized PC grammar systems with context-sensitive components that work in nonreturning mode. Here, however, we show that the class of languages that are generated by centralized PC grammar systems with context-sensitive components working in nonreturning mode coincides with the complexity class NEXT.


Mittwoch, 23.11.2011, 14:00 Uhr, Raum WA1318: Peter Cerno (Karls-Universität Prag)

Clearing Restarting Automata

Restarting automata were introduced as a model for analysis by reduction, which is a linguistically motivated method for checking correctness of a sentence. We propose a new restricted version of restarting automata called clearing restarting automata with a very simple definition but with interesting properties with respect to their possible applications. Although clearing restarting automata recognize even some non-context-free languages, they do not recognize all context-free languages. Therefore we introduce also an extended model, called the delta-clearing restarting automata, which is able to recognize all context-free languages. We also mention some open problems and possible directions of the future research in this area.


Mittwoch, 9.11.2011, 14:00 Uhr, Raum WA1318: Martin Lange (Uni Kassel)

Size-Change Termination and Emptiness for Alternating Parity Automata

In the automata-theoretic framework, finite-state automata are used as a machine model to capture the operational content of temporal logics. Decision problems like satisfiability, subsumption, equivalence, etc. then translate into questions on automata like emptiness, inclusion, language equivalence, etc. Linear-time temporal logics like LTL, PSL and the linear-time mu-calculus have relatively simple translations into alternating parity automata, and this automaton model is closed under all Boolean operations with very simple constructions. Thus, the typical decision problems for such linear-time temporal logics reduce relatively simply to the emptiness problem for alternating parity automata. In this paper we present a method for deciding this emptiness problem without going through intermediate automaton models like nondeterministic ones. The method is a direct adaptation of the size-change termination principle which was originally used to decide termination of abstract functional programs.


Mittwoch, 19.9.2012, 14:00 Uhr, Raum WA1318: Bahareh Badban (Uni Kassel)

Exact Incremental Analysis of Timed Automata with an SMT-Solver.

Timed automata as acceptors of languages of finite timed words form a very useful framework for the verification of safety properties of real-time system. Many of the classical automata-theoretic decision problems are undecidable for timed automata, for instance the subsumption or the universality problem. In this paper we consider restrictions of these problems: universality for deterministic timed automata and subsumption of a nondeterministic one by a deterministic one. We show that these problems are polynomial-time equivalent to the emptiness problem of nondeterministic timed automata, i.e.\ PSPACE-complete. We then advocate the use of SMT solvers for the exact incremental analysis of timed automata via these problems. We stratify these problems by considering domains of timed words of bounded length only and show that each bounded instance is NP-complete. We present some experimental data obtained from a prototypical implementationq measuring the practical feasibility of the approach to timed automata via SMT solvers.


Mittwoch, 13.7.2011, 11:00 Uhr, Raum WA1318: Norbert Hundeshagen (Uni Kassel)

Characterizing the Regular Languages by Nonforgetting Restarting Automata

The restarting automaton is a machine model that is motivated by the technique of analysis by reduction from linguistics. Basically it can be seen as an extension of finite state automaton. It is well known that some types of restarting automata with window size one compute exactly the regular languages. This talk focuses on the these types of automata additionally equipped with the nonforgetting property. The main result shows that the monotone variants of the nonforgetting restarting automata with window size one characterize the regular languages.


Mittwoch, 13.7.2011, 11:30 Uhr, Raum WA1318: Marcel Vollweiler (Uni Kassel)

Pushdown Automata with Translucent Pushdown Symbols

Pushdown automata with translucent pushdown symbols are presented. Such a device is a pushdown automaton $M$ that is equipped with a {`transparency relation'}~$\tau$. In a transition step, $M$ does not read (and replace) the topmost symbol on its pushdown store, but the topmost one that is only covered by translucent symbols. We prove that these automata accept all recursively enumerable languages. Then we concentrate on pushdown automata with translucent pushdown symbols that work in real-time or in quasi-real-time. We compare the corresponding language classes to other classical complexity classes, and we study closure properties for these language classes.


Mittwoch, 22.6.2011 und 29.6.2011, 11:00 Uhr, Raum WA1318: Martin Lange (Uni Kassel)

Tableaux(-Like) Decision Procedures for Temporal Logics

Temporal logics are modal logics over infinite flows of time. They form important tools for the specification of program behaviour. Their satisfiability problems therefore form the algorithmic essence of consistency checks for logical specifications of correct program behaviour.
Temporal operators usually have elegant characterisations in terms of fixpoint solutions to certain recursive equations. This often makes the evaluation of temporal formulas in Kripke structures relatively simple using fixpoint iteration techniques. It also introduces very particular difficulties for deciding satisfiability: one has to ensure that iterations corresponding to least fixpoint constructs are well-founded.
In this tutorial we will review basic temporal logics and tableau-based methods for their satisfiability problems. We will illustrate the problems arising with a mixture of least and greatest fixpoint constructs in such tableaux and discuss known solutions as well as related and open questions in this area.
The tutorial will be held at an introductory level. No particular knowledge about temporal logics will be required. However, participant will be expected to have some knowledge and logic in general. Some knowledge on automata theory will be helpful but is not essential.


Mittwoch, 15.6.2011, 11:00 Uhr, Raum WA1318: Bahareh Badban (Uni Kassel)

Towards an Automatized Predicate Abstraction of Dense Real-Time Automata

Real-time requirements, in particular on meeting hard real-time bounds, play an important role in the design of concurrent, embedded real-time systems. In many application areas, such as transportation, process control or medical automation, those systems are safety-critical, i.e., their malfunctioning may entail the loss of life. Efficient verification technology is hence a crucial desideratum for the real-time system design process. Due to the inherent complexity that these systems possess, manual verification approaches are impractical.
To scale the existing verification strategies to the analysis of real-life systems engaging time with realistic size, our goal is to create an automatic abstraction-based verification approach for concurrent dense real-time models. In the course of verification of a system it is realised that many important properties of real-time designs are in fact safety properties. Safety properties can be chacked using reachability analysis of the real-time model. Therefore, in our investigations we will focus on solving this class Our aim is to develop a completely automatic predicate abstraction method for the verification of concurrent dense real-time systems. The idea of abstraction is to reduce the dense timed automata into finite tractable size automata. With the intention of increasing the scalability of existing techniques, we have started to develop an algorithm which first investigates for idle transitions imposed from hidden state invariants. A particular challenge lies in catering for various forms of inter-process communications. Based on the initial results a project proposal is now being developed.


Mittwoch, 1.6.2011, 11:00 Uhr, Raum WA1318: Friedrich Otto (Uni Kassel)

Kooperierende verteilte Systeme von zustandslosen deterministischen Restart-Automaten mit Fenstergröße eins

The restarting automaton is a machine model that is motivated by the technique of analysis by reduction from linguistics. It consists of a finite-state control and a flexible type with end markers and a read/write window of a fixed size. This talk focuses on the weakest model of the restarting au- tomaton: the so-called R-automaton with a read/write window of size one (R(1)-automaton for short). It is well-known that R(1)-automata accept exactly the regular languages, while stateless deterministic R(1)-automata just accept regular languages of a very restricted form. Accordingly we combine a finite number of such automata into a cooperating distributed system (CD-system) of stateless deterministic R(1)-automata. These CD-systems only accept languages with semi-linear Parikh images, but they turn out to be quite powerful, as they accept all rational trace languages. In fact, the rational trace languages (and even the context-free trace languages) can been characterized in terms of certain CD-systems of stateless deterministic R(1)-automata. If the components of these CD-system are not required to be stateless, then these systems are strictly more expressive, as then they even accept some languages that are not semi-linear.


Dienstag (!), 22.2.2011, 10:15 Uhr, Raum WA1318: Markus Latte (LMU München)

Separation Results for XCTL

XCTL[A] is an extension of CTL which refines the temporal until and release operators with formal languages in A. In this way, XCTL can express non-regular properties, in contrast to CTL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective XCTL can be proven by automata-theoretic techniques. However, these techniques introduce non-determinism on the automata side. As non-determinism is also the difference between DCFL and CFL, these techniques seem to be inappropriate to separate XCTL[DCFL] from XCTL[CFL]. Nevertheless, we show the separation of DCFL from CFL for the EF/AG-fragment of XCTL.


Freitag (!) 21.1.2011, 10:15 Uhr, Raum WA1318: Etienne Lozes (RWTH Aachen)

From Spatial Logics to Separation Logic

Spatial Logics were introduced by Cardelli and Gordon in the early 2000s, and were first devoted to the specification of mobile processes . They were then extended to static structures, including XML documents and graphs. Almost at the same time, Separation Logic was popularized by Reynolds' 2002 Lics invited paper, and up to today increases its influence in many researches, both from theory and very practical aspects. In this talk, I will try to survey the theoretical aspects of my work (I will skip the more practical ones I have been involved in this last years), with a shift of interest from Spatial Logic towards Separation Logic. I will present the expressivity, decidability, and complexity results for several spatial and separation logics, extended or not by temporal constructs.


15.12.2010, 15:15 Uhr, Raum WA1318: Norbert Hundeshagen (Uni Kassel)

Transducing by Observing

Ein Großteil der in den letzten Jahren entwickelten Berechnungsmodelle wurde durch biochemische Prozesse motiviert. Viele dieser Maschinismen folgen dabei dem bekannten black-box-Konzept: Eine Eingabe wird direkt in eine Ausgabe überführt, welche das Ergebnis der Berechnung ist und Aufschluss über die Berechnungskraft gibt. Die in diesem Vortrag im Mittelpunkt stehenden Beobachtersysteme nutzen einen anderen Ansatz: Von Interesse ist nicht ausschließlich das Produkt eines solchen Systems, sondern die Veränderung des Systems selber. Die Berechnungskraft verschiedener Spracherzeugender oder -akzeptierender Systeme ist in diesem Zusammenhang bereits untersucht worden. Dieses Konzept wird hier um Beobachtersysteme erweitert, die Transduktionen berechnen.


1.12.2010, 15:15 Uhr, Raum WA1318: Martin Lange (Uni Kassel)

Bounded Model Checking und Analyse kontext-freier Grammatiken

Viele Probleme über kontext-freie Grammatiken sind unentscheidbar, wie z.B. Mehrdeutigkeit, Universalität, Subsumption, Äquivalenz, etc. Schränkt man diese jedoch auf Wörter einer maximalen Länge ein, so sind sie typischerweise in NP oder coNP. Bsp.: Das beschränkte Universalitätsproblem nimmt als Eingabe eine kontext-freie Grammatik und eine Zahl k in unärer Kodierung und entscheidet, ob es ein Wort der Länge höchstens k gibt, welches nicht von der Grammatik erzeugt wird. Erhöht man sukzessive nun den Parameter k, so erhält man natürlich ein Semi-Entscheidungsverfahren für das jeweils ursprüngliche Problem.
Eine ähnliche Technik - allerdings "nur" eine Reduzierung von PSPACE auf NP - wird beim Bounded Model Checking eingesetzt. Zusätzlich macht man sich zunutze, dass Probleme in NP oft gut von SAT-Solvern gelöst werden können.
In diesem Vortrag stellen wir zunächst Bounded Model Checking vor und zeigen dann, wie sich diese Technik auf die oben genannten Probleme anwenden lässt, um in der Praxis sogar verwendbare Semi-Entscheidungsverfahren zu gewinnen.


10.11.2010, 15:00 Uhr, Raum WA2104: Jan Hoffmann (LMU München)

Analyzing Sorting Algorithms with Resource Aware ML

Recently we developed an automatic amortized analysis to compute polynomial resource bounds for first-order functional programs at compile time. Its basis is a type system that augments types with resource annotations.
The analysis system has been implemented in the programming language Resource Aware ML. Our experiments showed that it efficiently computes precise time and heap bounds for many typical programs.
In this talk I will demonstrate the implementation by computing worst-case bounds for the sorting algorithms quick sort and insertion sort. To illustrate pros and cons, I compare our automatic analysis to a manual analysis of the algorithms in a popular textbook.
For more information see the web page of the project: raml.tcs.ifi.lmu.de