Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Adsul, Bharat"'
Autor:
Adsul, Bharat, Jain, Nehul
We propose a new model of a distributed game, called an ATS game, which is played on a non-deterministic asynchronous transition system -- a natural distributed finite-state device working on Mazurkiewicz traces. This new partial-information game is
Externí odkaz:
http://arxiv.org/abs/2410.04420
Publikováno v:
In LICS'24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, ACM, 2024, Article No.: 2, Pages 1-13
We propose a local, past-oriented fragment of propositional dynamic logic to reason about concurrent scenarios modelled as Mazurkiewicz traces, and prove it to be expressively complete with respect to regular trace languages. Because of locality, spe
Externí odkaz:
http://arxiv.org/abs/2405.11308
In this paper we study the orbit closure problem for a reductive group $G\subseteq GL(X)$ acting on a finite dimensional vector space $V$ over $\C$. We assume that the center of $GL(X)$ lies within $G$ and acts on $V$ through a fixed non-trivial char
Externí odkaz:
http://arxiv.org/abs/2309.15816
Let $G$ be a connected reductive group acting on a complex vector space $V$ and projective space ${\mathbb P}V$. Let $x\in V$ and ${\cal H}\subseteq {\cal G}$ be the Lie algebra of its stabilizer. Our objective is to understand points $[y]$, and thei
Externí odkaz:
http://arxiv.org/abs/2201.00135
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as boolean closu
Externí odkaz:
http://arxiv.org/abs/2107.01468
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 2 (June 28, 2022) lmcs:7504
We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between eve
Externí odkaz:
http://arxiv.org/abs/2105.10897
We develop a new algebraic framework to reason about languages of Mazurkiewicz traces. This framework supports true concurrency and provides a non-trivial generalization of the wreath product operation to the trace setting. A novel local wreath produ
Externí odkaz:
http://arxiv.org/abs/2007.07940
Publikováno v:
Operations Research 69(2), 613-631, 2021
The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices. This paper comprehensively analyzes games of rank one, and shows the following: (1) For a game of rank r, the set of its Nash equilibria is the intersection of a ge
Externí odkaz:
http://arxiv.org/abs/1812.04611
This paper extends a recently proposed robust computational framework for constructing the boundary representation (brep) of the volume swept by a given smooth solid moving along a one parameter family $h$ of rigid motions. Our extension allows the i
Externí odkaz:
http://arxiv.org/abs/1405.7457
This paper proposes a robust algorithmic and computational framework to address the problem of modeling the volume obtained by sweeping a solid along a trajectory of rigid motions. The boundary representation (simply brep) of the input solid naturall
Externí odkaz:
http://arxiv.org/abs/1404.0119