Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Namit Chaturvedi"'
Autor:
Namit Chaturvedi, Marcus Gelderie
Publikováno v:
Information and Computation. 256:23-34
We address the problem of providing a Borel-like classification of languages of infinite Mazurkiewicz traces, and provide a solution in the framework of ω -automata over infinite words – which is invoked via the sets of linearizations of infinitar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f040974545d187869f087da07d176bf
https://doi.org/10.1016/j.ic.2017.04.006
https://doi.org/10.1016/j.ic.2017.04.006
Publikováno v:
International Journal of Foundations of Computer Science. 23:985-1000
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We anal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e588fa1738250c0721f9d305ff6f9bc8
https://doi.org/10.1142/s0129054112400412
https://doi.org/10.1142/s0129054112400412
Autor:
Namit Chaturvedi
Publikováno v:
Automata, Languages, and Programming ISBN: 9783662439500
ICALP (2)
ICALP (2)
The family of regular languages of infinite words is structured into a hierarchy where each level is characterized by a class of deterministic ω-automata – the class of deterministic Buchi automata being the most prominent among them. In this pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0398ecd02d5ce9e18d38d97d55cfa31
https://doi.org/10.1007/978-3-662-43951-7_12
https://doi.org/10.1007/978-3-662-43951-7_12
Autor:
Namit Chaturvedi, Marcus Gelderie
Publikováno v:
Mathematical Foundations of Computer Science 2014 ISBN: 9783662445211
MFCS (1)
MFCS (1)
We address the problem of providing a Borel-like classification of languages of infinite Mazurkiewicz traces, and provide a solution in the framework of ω-automata over infinite words – which is invoked via the sets of linearizations of infinitary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb7f2a33823581a7f77d595c01d8ac84
https://doi.org/10.1007/978-3-662-44522-8_15
https://doi.org/10.1007/978-3-662-44522-8_15
Publikováno v:
Developments in Language Theory ISBN: 9783642223204
Developments in Language Theory
Developments in Language Theory
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We anal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b46e824bbed7fc7209962e68596a4dc7
https://doi.org/10.1007/978-3-642-22321-1_16
https://doi.org/10.1007/978-3-642-22321-1_16
Autor:
Meenakshi Balasubramanian, Atish Datta Chowdhury, Abhishek Bhatnagar, Namit Chaturvedi, Arul Ganesh
Publikováno v:
AsiaCCS
We present a framework for decentralized authorization for physical access control, using smart cards, where access to individual rooms is guarded by context-dependent policies that are dynamically evaluated. Policies are specified using a logical la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a4eb57ec3f40b22c524bd377b0b6e0e
https://doi.org/10.1145/1229285.1229302
https://doi.org/10.1145/1229285.1229302