Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,569,551 papers from all fields of science

Search

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…

Highly Cited

2014

Highly Cited

2014

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is…

2013

2013

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

2010

2010

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

2010

2010

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

Highly Cited

2009

Highly Cited

2009

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

2006

2006

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

2005

2005

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

2002

2002

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

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…