• Publications
  • Influence
Faster algorithms for mean-payoff games
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph withExpand
  • 118
  • 20
  • Open Access
From Bisimulation to Simulation: Coarsest Partition Problems
The notions of bisimulation and simulation are used for graph reduction and are widely employed in many areas: modal logic, concurrency theory, set theory, formal verification, and so forth. InExpand
  • 102
  • 16
  • Open Access
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistinguishable states,Expand
  • 67
  • 7
  • Open Access
Quantitative Languages Defined by Functional Automata
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: theExpand
  • 35
  • 6
  • Open Access
Computing strongly connected components in a linear number of symbolic steps
We present an algorithm that computes in a linear number of symbolic steps (<i>O</i>(|<i>V</i>|)) the strongly connected components (sccs) of a graph <i>G</i> = ⟨<i>V, E</i>⟩ represented by anExpand
  • 87
  • 3
  • Open Access
The Complexity of Rational Synthesis
We study the computational complexity of the cooperative and non-cooperative rational synthesis problems, as introduced by Kupferman, Vardi and co-authors. We provide tight results for most of theExpand
  • 24
  • 3
  • Open Access
Symbolic Graphs: Linear Solutions to Connectivity Related Problems
Abstract The importance of symbolic data structures such as Ordered Binary Decision Diagrams (OBDD) is rapidly growing in many areas of Computer Science where the large dimensions of the input modelsExpand
  • 29
  • 2
  • Open Access
Simulation as Coarsest Partition Problem
The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure.Expand
  • 13
  • 2
  • Open Access
Rational Synthesis Under Imperfect Information
In this paper, we study the rational synthesis problem for turn-based multiplayer non zero-sum games played on finite graphs for omega-regular objectives. Rationality is formalized by the concept ofExpand
  • 9
  • 2
Quantitative Languages Defined by Functional Automata
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: theExpand
  • 9
  • 1