Formal verification increasingly has become recognized as an answer to the problem of how
to create ever more complex control systems, which nonetheless are required to behave …

We present an algorithm to generate small Büchi automata for LTL formulae. We describe a
heuristic approach consisting of three phases: rewriting of the formula, an optimized …

In this paper, we formulate and analyze methodologies for verifying the notion of initial-state
opacity in discrete event systems that are modeled as non-deterministic finite automata with …

We describe a family of optimizations implemented in a translation from a linear temporal
logic to Büchi automata. Such optimized automata can enhance the efficiency of model …

Finite linear systems are finite sets of linear functions whose guards are defined by
Presburger formulas, and whose the squares matrices associated generate a finite …

We describe a new and more efficient algorithm for checking universality and language
inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the …

We characterize the class of nondeterministic ω-automata that can be used for the analysis
of finite Markov decision processes (MDPs). We call these automata 'good-for-MDPs'(GFM) …

The simulation preorder for labeled transition systems is defined locally, and operationally,
as a game that relates states with their immediate successor states. Simulation enjoys many …

We give efficient algorithms, improving optimal known bounds, for computing a variety of
simulation relations on the state space of a Büchi automaton. Our algorithms are derived via …

We consider games where the winning conditions are disjunctions (or dually, conjunctions)
of parity conditions; we call them generalized parity games. These winning conditions, while …