Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Shah, Simoni S."'
Autor:
Pandya, Paritosh K., Shah, Simoni S.
The class of Unambiguous Star-Free Regular Languages (UL) was defined by Schutzenberger as the class of languages defined by Unambiguous Polynomials. UL has been variously characterized (over finite words) by logics such as TL[X_a,Y_a], UITL, TL[F,P]
Externí odkaz:
http://arxiv.org/abs/1401.2714
Autor:
Pandya, Paritosh K., Shah, Simoni S.
Publikováno v:
Proc. ATAV 2012, LNCS 7561, 2012. pp 77-91
We study two unary fragments of the well-known metric interval temporal logic MITL[U_I,S_I] that was originally proposed by Alur and Henzinger, and we pin down their expressiveness as well as satisfaction complexities. We show that MITL[F_\inf,P_\inf
Externí odkaz:
http://arxiv.org/abs/1305.3204
Autor:
Pandya, Paritosh K., Shah, Simoni S.
Publikováno v:
Proc. CONCUR 2011, LNCS 6901, 2011. pp 60-75
Timed temporal logics exhibit a bewildering diversity of operators and the resulting decidability and expressiveness properties also vary considerably. We study the expressive power of timed logics TPTL[U,S] and MTL[U,S] as well as of their several f
Externí odkaz:
http://arxiv.org/abs/1102.5638
Autor:
Pandya, Paritosh K., Shah, Simoni S.
Publikováno v:
Theoretical Aspects of Computing - ICTAC 2013; 2013, p301-318, 18p
Autor:
Pandya, Paritosh K., Shah, Simoni S.
Publikováno v:
Automated Technology for Verification & Analysis (9783642333859); 2012, p77-91, 15p
Autor:
Pandya, Paritosh K., Shah, Simoni S.
Publikováno v:
Formal Modeling & Analysis of Timed Systems (9783642152962); 2010, p168-182, 15p
Publikováno v:
Developments in Language Theory (9783642144547); 2010, p303-315, 13p