A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific… Expand

This paper surveys recent results on the classiffication of discrete temporal properties, gives an introduction to the methods that have been developed to obtain them, and explains the connections to the theory of finite automata and first-order logic.Expand

AIMS
Based on an analysis of claims-based data of 8.298 million members of two German statutory health insurance funds, the aim of this contribution is to quantify age-/gender-specific… Expand

We give efficient algorithms, beating or matching optimal known bounds, for computing a variety of simulation relations on the state space of a Buchi automaton using a unified and simple parity-game framework.Expand

We investigate the power of first-order logic with only two variables over /spl omega/-words and finite words, a logic denoted by FO/sup 2/, a logic we denote by unary-TL.Expand

A coherent exposition of the connection of alternating tree automata and modal μ-calculus is given, advocating an automaton model specifically tailored for working with modal μ-calculus. The… Expand

We show a property of strings is expressible in the two-variable fragment of first-order logic if and only if it is express ible by both a 2 and a 2 sentence.Expand