MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Olivier Serre" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 8 documents found, showing 1 through 8.
ATOM RSS
  • Games with winning conditions of high borel complexity  
  • by Olivier Serre — 2004 — In Proceedings of ICALP’04, volume 3142 of LNCS
  • …Abstract. We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We …
  • Cited by 4 (2 self)Add To MetaCart
  • Parity games played on transition graphs of one-counter processes  
  • by Olivier Serre — 2006 — In FoSSaCS
  • …Abstract. We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [23] that deciding the winner is an ExpTime-complete problem. An important corollary of this result is that the µ-calculus mode…
  • Cited by 4 (0 self)Add To MetaCart
  • Regularity Problems for Visibly Pushdown Languages  
  • by Olivier Serre
  • …Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automat…
  • Add To MetaCart
  • Propositional dynamic logic with recursive programs  
  • by Christof Löding, Olivier Serre — 2006 — In Proc. FOSSACS 2006, LNCS 3921
  • …Abstract. We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, generalising known decida…
  • Cited by 3 (0 self)Add To MetaCart
  • Visibly pushdown games  
  • by Christof Löding, P. Madhusudan, Olivier Serre — 2004 — In FSTTCS 2004
  • …Abstract. The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is gi…
  • Cited by 13 (6 self)Add To MetaCart
  • Regularity problems for visibly pushdown languages  
  • by Vince Bárány, Christof Löding, Olivier Serre — 2006 — STACS 2006
  • …Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automat…
  • Cited by 3 (0 self)Add To MetaCart
  • µ-calculus Pushdown Module Checking with Imperfect State Information  
  • by Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre
  • …Abstract. The model checking problem for open systems (module checking) has recently been the subject of extensive study. The problem was first studied by Kupferman, Vardi, and Wolper for finite-state systems and properties expressed in the branching time logics CTL and CTL ∗. Further study continue…
  • Add To MetaCart
  • Regularity Problems for Visibly Pushdown  
  • by Languages Vince Barany, Vince Bárány, Christof Löding, Olivier Serre — 2006 — STACS 2006
  • …Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton tha…
  • Add To MetaCart
Help! Showing 1 through 8.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB