Searching for authors named "Olivier Serre" – sorted by Relevance.
-
Games with winning conditions of high borel complexity
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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

