Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2019

2019

The paper presents a new tool ltl3tela translating LTL to deterministic or nondeterministic transition-based Emerson-Lei automata… Expand

2017

2017

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

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… Expand

2013

2013

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

2010

2010

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

2010

2010

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

2006

2006

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

2005

2005

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

2002

2002

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

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