Paritosh K. Pandya

Paritosh K. Pandya, Simoni S. Shah: The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower Bound Constraints. ATVA 2012: 77-91

Paritosh K. Pandya, Simoni S. Shah: On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. CONCUR 2011: 60-75

Dileep Raghunath Kini, Shankara Narayanan Krishna, Paritosh K. Pandya: On Construction of Safety Signal Automata for $MITL[\: \mathcal{U}, \: \mathcal{S}]$ Using Temporal Projections. FORMATS 2011: 225-239

Paritosh K. Pandya, Simoni S. Shah: On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality and Deterministic Freezing. CoRR abs/1102.5638 (2011)

Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah: Around Dot Depth Two. Developments in Language Theory 2010: 303-315

Paritosh K. Pandya, Simoni S. Shah: Unambiguity in Timed Regular Languages: Automata and Logics. FORMATS 2010: 168-182

P. Vijay Suman, Paritosh K. Pandya: Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions. LATA 2009: 728-739

Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya: Efficient guided symbolic reachability using reachability expressions. STTT 10(2): 113-129 (2008)

Swarup Mohalik, A. C. Rajeev, Manoj G. Dixit, S. Ramesh, P. Vijay Suman, Paritosh K. Pandya, Shengbing Jiang: Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts. DAC 2008: 296-299

P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, Lakshmi Manasa: Timed Automata with Integer Resets: Language Inclusion and Expressiveness. FORMATS 2008: 78-92

Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah: Marking the chops: an unambiguous temporal logic. IFIP TCS 2008: 461-476

P. Vijay Suman, Paritosh K. Pandya: Timed and Hybrid Automata in SAL. SYNASC 2008: 480-486

Paritosh K. Pandya, Shankara Narayanan Krishna, Kuntal Loya: On Sampling Abstraction of Continuous Time Logic with Durations. TACAS 2007: 246-260

Raman Kazhamiakin, Paritosh K. Pandya, Marco Pistore: Timed Modelling and Analysis in Web Service Compositions. ARES 2006: 840-846

Kamal Lodaya, Paritosh K. Pandya: A Dose of Timed Logic, in Guarded Measure. FORMATS 2006: 260-273

Raman Kazhamiakin, Paritosh K. Pandya, Marco Pistore: Representation, Verification, and Computation of Timed Properties in Web. ICWS 2006: 497-504

Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya: Efficient Guided Symbolic Reachability Using Reachability Expressions. TACAS 2006: 120-134

Paritosh K. Pandya: Finding Extremal Models of Discrete Duration Calculus formulae using Symbolic Search. Electr. Notes Theor. Comput. Sci. 128(6): 247-262 (2005)

Shankara Narayanan Krishna, Paritosh K. Pandya: Modal Strength Reduction in Quantified Discrete Duration Calculus. FSTTCS 2005: 444-456

Babita Sharma, Paritosh K. Pandya, Supratik Chakraborty: Bounded Validity Checking of Interval Duration Logic. TACAS 2005: 301-316

Gaurav Chakravorty, Paritosh K. Pandya: Digitizing Interval Duration Logic. CAV 2003: 167-179

Paritosh K. Pandya, Jaikumar Radhakrishnan (Eds.): FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings. Lecture Notes in Computer Science 2914, Springer 2003, isbn 3-540-20680-9

Paritosh K. Pandya: The Saga of Synchronous Bus Arbiter: On Model Checking Quantitative Timing Properties of Synchronous Programs. Electr. Notes Theor. Comput. Sci. 65(5): 110-124 (2002)

Paritosh K. Pandya: Interval Duration Logic: Expressiveness and Decidability. Electr. Notes Theor. Comput. Sci. 65(6): 254-272 (2002)

Paritosh K. Pandya: Model Checking CTL*[DC]. TACAS 2001: 559-573

Paritosh K. Pandya, Y. S. Ramakrishna: Recursive Mean-Value Calculus. FSTTCS 1998: 257-268

Paritosh K. Pandya, Dang Van Hung: Duration Calculus of Weakly Monotonic Time. FTRTFT 1998: 55-64

Manoranjan Satpathy, Dang Van Hung, Paritosh K. Pandya: Some Decidability Results for Duration Calculus under Synchronous Interpretation. FTRTFT 1998: 186-197

Paritosh K. Pandya, H.-P. Wang, Qiwen Xu: Toward a theory of sequential hybrid programs. PROCOMET 1998: 366-384

Paritosh K. Pandya: Weak Chop Inverses and Liveness in Mean-Value Calculus. FTRTFT 1996: 148-167

Michael R. Hansen, Paritosh K. Pandya, Zhou Chaochen: Finite Divergence. Theor. Comput. Sci. 138(1): 113-139 (1995)

Paritosh K. Pandya: Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability. CSL 1995: 434-451

K. Narayan Kumar, Paritosh K. Pandya: On the Computational Power of Operators in ICSP with Fairness. FSTTCS 1994: 231-242

Huiqun Yu, Paritosh K. Pandya, Yongqiang Sun: A Calculus for Hybrid Sampled Data Systems. FTRTFT 1994: 716-737

Xinyao Yu, Ji Wang, Chaochen Zhou, Paritosh K. Pandya: Formal Design of Hybrid Systems. FTRTFT 1994: 738-755

K. Narayan Kumar, Paritosh K. Pandya: Infinitary Parallelism without Unbounded Nondeterminism in CSP. Acta Inf. 30(5): 467-487 (1993)

M. R. K. Krishna Rao, Paritosh K. Pandya, R. K. Shyamasundar: Verification Tools in the Development of Provably Correct Compilers. FME 1993: 442-461

K. Narayan Kumar, Paritosh K. Pandya: ICSP and Its Relationship with ACSP and CSP. FSTTCS 1993: 358-372

Paul H. B. Gardiner, Paritosh K. Pandya: Reasoning Algebraically about Recursion. Sci. Comput. Program. 18(3): 271-280 (1992)

Paritosh K. Pandya, Mathai Joseph: P - A Logic - A Compositional Proof System for Distributed Programs. Distributed Computing 5: 37-54 (1991)

Jonathan P. Bowen, Jifeng He, Paritosh K. Pandya: An Approach to Verifiable Compiling Specification and Prototyping. PLILP 1990: 45-59

Paritosh K. Pandya: Some Comments on the Assumption-Commitment Framework for Compositional Verification of Distributed Programs. REX Workshop 1989: 622-640

Mathai Joseph, Paritosh K. Pandya: Finding Response Times in a Real-Time System. Comput. J. 29(5): 390-395 (1986)

Paritosh K. Pandya, Mathai Joseph: A Structure-Directed Total Correctness Proof Rule for Recursive Procedure Calls. Comput. J. 29(6): 531-537 (1986)