Weighted Lumpability on Markov Chains. - Arpit Sharma 002; Joost-Pieter Katoen (Ershov Memorial Conference, 2011)

Weighted Probabilistic Equivalence Preserves ω-Regular Properties. - Arpit Sharma 002 (MMB/DFT, 2012)

A Two Step Perspective for Kripke Structure Reduction - Arpit Sharma 002 (CoRR, 2012)

Layered Reduction for Modal Specification Theories. - Arpit Sharma 002; Joost-Pieter Katoen (FACS, 2013)

Layered Reduction for Abstract Probabilistic Automata. - Arpit Sharma 002; Joost-Pieter Katoen (ACSD, 2014)

Reduction Techniques for Nondeterministic and Probabilistic Systems. - Arpit Sharma 002 (2015)

Interactive Markovian Equivalence. - Arpit Sharma 002 (EPEW, 2017)

Trace Relations and Logical Preservation for Continuous-Time Markov Decision Processes. - Arpit Sharma 002 (ICTAC, 2017)

Trace Relations and Logical Preservation for Markov Automata. - Arpit Sharma 002 (FORMATS, 2018)

Non-bisimulation Based Behavioral Relations for Markov Automata. - Arpit Sharma 002 (FORMATS, 2018)

Revisiting Trace Equivalences for Markov Automata. - Arpit Sharma 002 (FACS, 2019)

On the Use of Word Embeddings for Identifying Domain Specific Ambiguities in Requirements. - Siba Mishra; Arpit Sharma 002 (RE Workshops, 2019)

Stuttering for Markov Automata. - Arpit Sharma 002 (TASE, 2019)

Clustering Glossary Terms Extracted from Large-Sized Software Requirements using FastText. - Kushagra Bhatia; Siba Mishra; Arpit Sharma 002 (ISEC, 2020)

Automatic Word Embeddings-Based Glossary Term Extraction from Large-Sized Software Requirements. - Siba Mishra; Arpit Sharma 002 (REFSQ, 2020)

State Space Minimization Preserving Embeddings for Continuous-Time Markov Chains. - Susmoy Das; Arpit Sharma 002 (EPEW, 2021)

A Generalized Semantic Filter for Glossary Term Extraction from Large-Sized Software Requirements. - Siba Mishra; Arpit Sharma 002 (ISEC, 2021)

Crawling Wikipedia Pages to Train Word Embeddings Model for Software Engineering Domain. - Siba Mishra; Arpit Sharma 002 (ISEC, 2021)

Sector classification for crowd-based software requirements. - Kushagra Bhatia; Arpit Sharma 002 (SAC, 2021)

Embeddings between state and action labeled probabilistic systems. - Susmoy Das; Arpit Sharma 002 (SAC, 2021)

The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism. - Arpit Sharma 002 (Theor. Comput. Sci., 2021)

Linguistically Motivated Features for Classifying Shorter Text into Fiction and Non-Fiction Genre. - Arman Kazmi; Sidharth Ranjan; Arpit Sharma 002; Rajakrishnan Rajkumar (COLING, 2022)

Identification of Intra-Domain Ambiguity using Transformer-based Machine Learning. - Ambarish Moharil; Arpit Sharma 002 (NLBSE, 2022)

Probabilistic Model Checking of Temporal Interaction Dynamics in the Supreme Court. - Susmoy Das; Arpit Sharma 002 (DataMod, 2023)

On the Use of Model and Logical Embeddings for Model Checking of Probabilistic Systems. - Susmoy Das; Arpit Sharma 002 (FORTE, 2023)

TABASCO: A transformer based contextualization toolkit. - Ambarish Moharil; Arpit Sharma 002 (Sci. Comput. Program., 2023)

Process Mining Meets Probabilistic Model Checking via Model and Logical Embeddings. - Susmoy Das; Arpit Sharma 002 (Principles of Verification (2), 2024)

Classification of Crowd-Based Software Requirements via Unsupervised Learning. - Naimish Sharma; Arpit Sharma 002 (QUATIC, 2024)

A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems. - Susmoy Das; Arpit Sharma 002 (SAC, 2024)

Embeddings Between State and Action Based Probabilistic Logics. - Susmoy Das; Arpit Sharma 002 (Formal Aspects Comput., 2025)