Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski… Expand

Is this relevant?

2013

2013

We present a new ranking based construction for disambiguating non-deterministic Buchi automata and show that the state… Expand

Is this relevant?

2013

2013

Weakly definable languages of infinite trees are an expressive subclass of regular tree languages definable in terms of weak… Expand

Is this relevant?

2010

2010

In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite… Expand

Is this relevant?

2010

2010

The Buchi acceptance condition specifies a set a of states, and a run is accepting if it visits α infinitely often. The co-Buchi… Expand

Is this relevant?

2009

2009

We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of… Expand

Is this relevant?

2006

2006

Computations are developed for the synthesis of a finite state machine (FSM) embedded in a known FSM such that their combined… Expand

Is this relevant?

2005

2005

Computations are developed for the synthesis of an FSM embedded in a known larger system such that the overall behavior satisfies… Expand

Is this relevant?

2002

2002

Behavioral properties of open systems can be formalized as objectives in two-player games. Turn-based games model asynchronous… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We present an algorithm to generate Buchi automata from LTL formulae. This algorithm generates a very weak alternating co-Buchi… Expand

Is this relevant?