28 citations · 43 across the 6 of their papers we have counts for
6 papers
Backward deterministic and weak alternating -automata
Sebastian Preugschat, Thomas Wilke
We present a direct transformation of weak alternating -automata into equivalent backward deterministic -automata and show (1) how it can be used to obtain a transformation o…
Complexity and Unwinding for Intransitive Noninterference
Sebastian Eggert, Ron van der Meyden, Henning Schnoor +1
The paper considers several definitions of information flow security for intransitive policies from the point of view of the complexity of verifying whether a finite-state system i…
Profile Trees for Büchi Word Automata, with Application to Determinization
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi +1
The determinization of Buchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been…
Unifying Büchi Complementation Constructions
Seth J. Fogarty, Orna Kupferman, Thomas Wilke +1
Complementation of Büchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approac…
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
Preugschat Sebastian, Thomas Wilke
We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain. The framework is based…
Noninterference with Local Policies
Sebastian Eggert, Henning Schnoor, Thomas Wilke
We develop a theory for state-based noninterference in a setting where different security policies---we call them local policies---apply in different parts of a given system. Our t…