Zobrazeno 1 - 10
of 271
pro vyhledávání: '"Rupak Majumdar"'
Publikováno v:
TheoretiCS, Vol Volume 2 (2023)
We consider fixpoint algorithms for two-player games on graphs with $\omega$-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of
Externí odkaz:
https://doaj.org/article/6b3519a0b3084f459a688dac55cd1a44
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 4 (2022)
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
Externí odkaz:
https://doaj.org/article/f95579cb2be14fbe85d3ea7ce947ecad
Autor:
Anthony W. Lin, Rupak Majumdar
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)
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 tha
Externí odkaz:
https://doaj.org/article/a67cb9a1db0c45a7bab19cf3a4c50944
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 286, Iss Proc. CREST 2018, Pp 31-33 (2019)
We present a comprehensive language theoretic causality analysis framework for explaining safety property violations in the setting of concurrent reactive systems. Our framework allows us to uniformly express a number of causality notions studied in
Externí odkaz:
https://doaj.org/article/e483880de8b44d9c83ab64e1b6a90df2
Autor:
Rayna Dimitrova, Rupak Majumdar
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 193, Iss Proc. GandALF 2015, Pp 100-114 (2015)
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization of automat
Externí odkaz:
https://doaj.org/article/fbb4439fd1c3454eafc4fb5b71bfbe8b
Autor:
Krishnendu Chatterjee, Rupak Majumdar
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 25, Iss Proc. GANDALF 2010, Pp 22-29 (2010)
We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical
Externí odkaz:
https://doaj.org/article/880a44e73e67432fbc61473a68c8251b
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 7 (2011)
We study game-theoretic mechanisms for routing in wireless ad hoc networks. Our major results include a combination of theoretical bounds and extensive simulations, showing that VCG-based routing in wireless ad-hoc networks exhibits small frugality r
Externí odkaz:
https://doaj.org/article/4faf5f1dd2a64211827ac4dd3cd4bf4b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
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 writte
Externí odkaz:
https://doaj.org/article/91724a4f19294727af1bc93dd5e0275e
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability d
Externí odkaz:
https://doaj.org/article/439ca66a17094e95a4f9c47d12e8009b
Autor:
Rupak Majumdar, Anne-Kathrin Schmuck
Publikováno v:
IEEE Transactions on Automatic Control. 68:385-392