Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
3 results

Algorithms for Game Metrics

Krishnendu Chatterjee ; Luca de Alfaro ; Rupak Majumdar ; Vishwanath Raman.
Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative {\mu}-calculus and related&nbsp;[&hellip;]
Published on September 1, 2010

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond

Rupak Majumdar ; Ramanathan S. Thinniyam ; Georg Zetzsche.
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show&nbsp;[&hellip;]
Published on October 21, 2022

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Anthony W. Lin ; Rupak Majumdar.
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the&nbsp;[&hellip;]
Published on October 29, 2021

  • < Previous
  • 1
  • Next >