An Axiomatization of Event Structures. - Madhavan Mukund; P. S. Thiagarajan (FSTTCS, 1989)

A Petri Net Model of Asynchronously Communicating Sequential Processes. - Madhavan Mukund; P. S. Thiagarajan (A Perspective in Theoretical Computer Science, 1989)

CCS, Location and Asynchronous Transition Systems. - Madhavan Mukund; Mogens Nielsen (FSTTCS, 1992)

Petri Nets and Step Transition Systems. - Madhavan Mukund (Int. J. Found. Comput. Sci., 1992)

A Logical Characterization of Well Branching Event Structures. - Madhavan Mukund; P. S. Thiagarajan (Theor. Comput. Sci., 1992)

Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. - Madhavan Mukund; Milind A. Sohoni (FSTTCS, 1993)

Determinizing Asynchronous Automata. - Nils Klarlund; Madhavan Mukund; Milind A. Sohoni (ICALP, 1994)

Determinizing Büchi Asnchronous Automata. - Nils Klarlund; Madhavan Mukund; Milind A. Sohoni (FSTTCS, 1995)

Keeping Track of the Latest Gossip in Message-Passing Systems. - Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni (STRICT, 1995)

Linear Time Temporal Logics over Mazurkiewicz Traces. - Madhavan Mukund; P. S. Thiagarajan (MFCS, 1996)

Keeping Track of the Latest Gossip in a Distributed System. - Madhavan Mukund; Milind A. Sohoni (Distributed Comput., 1997)

Towards a Characterisation of Finite-State Message-Passing Systems. - Madhavan Mukund; K. Narayan Kumar; Jaikumar Radhakrishnan; Milind A. Sohoni (ASIAN, 1998)

Robust Asynchronous Protocols Are Finite-State. - Madhavan Mukund; K. Narayan Kumar; Jaikumar Radhakrishnan; Milind A. Sohoni (ICALP, 1998)

Faster Model Checking for Open Systems. - Madhavan Mukund; K. Narayan Kumar; Scott A. Smolka (ASIAN, 1999)

Synthesizing Distributed Transition Systems from Global Specification. - Ilaria Castellani; Madhavan Mukund; P. S. Thiagarajan (FSTTCS, 1999)

Synthesizing Distributed Finite-State Systems from MSCs. - Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni (CONCUR, 2000)

On Message Sequence Graphs and Finitely Generated Regular MSC Languages. - Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan (ICALP, 2000)

Regular Collections of Message Sequence Charts. - Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan (MFCS, 2000)

Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. - Samik Basu 001; Madhavan Mukund; C. R. Ramakrishnan 001; I. V. Ramakrishnan; Rakesh M. Verma (ICLP, 2001)

Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems. - Madhavan Mukund (FSTTCS, 2002)

An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. - Paul Gastin; Madhavan Mukund (ICALP, 2002)

Netcharts: Bridging the gap between HMSCs and executable specifications. - Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan (CONCUR, 2003)

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. - Paul Gastin; Madhavan Mukund; K. Narayan Kumar (MFCS, 2003)

Checking Consistency of SDL+MSC Specifications. - Deepak D'Souza; Madhavan Mukund (SPIN, 2003)

Bounded time-stamping in message-passing systems. - Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni (Theor. Comput. Sci., 2003)

Causal Closure for MSC Languages. - Bharat Adsul; Madhavan Mukund; K. Narayan Kumar; Vasumathi Narayanan (FSTTCS, 2005)

Generic Verification of Security Protocols. - Abdul Sahid Khan; Madhavan Mukund; S. P. Suresh (SPIN, 2005)

A theory of regular MSC languages. - Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; Milind A. Sohoni; P. S. Thiagarajan (Inf. Comput., 2005)

A Fresh Look at Testing for Asynchronous Communication. - Puneet Bhateja; Paul Gastin; Madhavan Mukund (ATVA, 2006)

Matching Scenarios with Timing Constraints. - Prakash Chandrasekaran; Madhavan Mukund (FORMATS, 2006)

Anchored Concatenation of MSCs. - Madhavan Mukund; K. Narayan Kumar; P. S. Thiagarajan; Shaofa Yang (Formal Models, Languages and Applications, 2007)

Checking Coverage for Infinite Collections of Timed Scenarios. - S. Akshay 001; Madhavan Mukund; K. Narayan Kumar (CONCUR, 2007)

Local Testing of Message Sequence Charts Is Difficult. - Puneet Bhateja; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (FCT, 2007)

2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. - Ramesh Hariharan; Madhavan Mukund; V. Vinay (FSTTCS, 2008)

2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. - Ramesh Hariharan; Madhavan Mukund; V. Vinay (FSTTCS, 2008)

Tagging Make Local Testing of Message-Passing Systems Feasible. - Puneet Bhateja; Madhavan Mukund (SEFM, 2008)

Specifying Interacting Components with Coordinated Concurrent Scenarios. - Prakash Chandrasekaran; Madhavan Mukund (SEFM, 2009)

Model checking time-constrained scenario-based specifications. - S. Akshay 001; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (FSTTCS, 2010)

Assembling Sessions. - Philippe Darondeau; Loïc Hélouët; Madhavan Mukund (ATVA, 2011)

Kleene Theorems for Product Systems. - Kamal Lodaya; Madhavan Mukund; Ramchandra Phawade (DCFS, 2011)

Finite-State Automata on Infinite Inputs. - Madhavan Mukund (Modern Applications of Automata Theory, 2012)

Automata on Distributed Alphabets. - Madhavan Mukund (Modern Applications of Automata Theory, 2012)

Sessions with an Unbounded Number of Agents. - S. Akshay 001; Loïc Hélouët; Madhavan Mukund (ACSD, 2014)

Optimized OR-Sets without Ordering Constraints. - Madhavan Mukund; Ranjal Gautham Shenoy; S. P. Suresh (ICDCN, 2014)

Distributed Markov Chains. - Sumit Kumar Jha 001; Madhavan Mukund; Ratul Saha; P. S. Thiagarajan (CoRR, 2014)

Distributed Timed Automata with Independently Evolving Clocks. - S. Akshay 001; Benedikt Bollig; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Fundam. Informaticae, 2014)

Effective Verification of Replicated Data Types Using Later Appearance Records (LAR). - Madhavan Mukund; Ranjal Gautham Shenoy; S. P. Suresh (ATVA, 2015)

Bounded Implementations of Replicated Data Types. - Madhavan Mukund; Ranjal Gautham Shenoy; S. P. Suresh (VMCAI, 2015)

Distributed Markov Chains. - Ratul Saha; Javier Esparza; Sumit Kumar Jha 001; Madhavan Mukund; P. S. Thiagarajan (VMCAI, 2015)

Checking conformance for time-constrained scenario-based specifications. - S. Akshay 001; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Theor. Comput. Sci., 2015)

Time-Bounded Statistical Analysis of Resource-Constrained Business Processes with Distributed Probabilistic Systems. - Ratul Saha; Madhavan Mukund; R. P. Jagadeesh Chandra Bose (SETTA, 2016)

Knowledge Transfer and Information Leakage in Protocols. - Abdullah Abdul Khadir; Madhavan Mukund; S. P. Suresh (ATVA, 2017)

On Verifying TSO Robustness for Event-Driven Asynchronous Programs. - Ahmed Bouajjani; Constantin Enea; Madhavan Mukund; Rajarshi Roy 002 (NETYS, 2018)

Research in theoretical computer science. - Meena Mahajan; Madhavan Mukund; Nitin Saxena 001 (Commun. ACM, 2019)

Bounded Version Vectors Using Mazurkiewicz Traces. - Madhavan Mukund; Ranjal Gautham Shenoy; S. P. Suresh (ACSS (1), 2020)

Formalizing and Checking Multilevel Consistency. - Ahmed Bouajjani; Constantin Enea; Madhavan Mukund; Ranjal Gautham Shenoy; S. P. Suresh (VMCAI, 2020)

Generalising Projection in Asynchronous Multiparty Session Types. - Rupak Majumdar; Madhavan Mukund; Felix Stutz; Damien Zufferey (CONCUR, 2021)

Digital interventions at scale: lessons from NPTEL and IIT Madras B.S. degree program. - Jayakrishnan Warriem; Andrew Thangaraj; Madhavan Mukund; Bharathi Balaji (Commun. ACM, 2022)

Best Practices for Developing Computational Thinking. - Dan Garcia 001; Sonia Garcha; Madhavan Mukund; Vipul Shah (CompEd (2), 2023)

A Local-Time Semantics for Negotiations. - Madhavan Mukund; Adwitee Roy; B. Srivathsan (FORMATS, 2023)