Publications

• Asynchronous automata, Mazurkiewicz trace theory
• Message-passing systems
• Timed systems
• Bounded time-stamping
• Logics for concurrency based on partial-orders
• Non-interleaved models for concurrency
• Verification
• Computer Security

List of Papers

• A Theory of Regular MSC Languages
  J G Henriksen, M Mukund, K Narayan Kumar, M Sohoni and P S Thiagarjan
  Information and Computation, 202(1), (2005), 1--38.

• Bounded time-stamping in message-passing systems
  M Mukund, K Narayan Kumar and M Sohoni
  Theoretical Computer Science, 290(1), (2003), 221-239.

• Keeping Track of the Latest Gossip in a Distributed System
  M Mukund and M Sohoni
  Distributed Computing, 10, 3, (1997) 137-148.

• Petri Nets and Step Transition Systems
  M Mukund
  International Journal of Foundations of Computer Science 3, 4, (1992) 443-478.

• A Logical Characterization of Well Branching Event Structures
  M Mukund and P S Thiagarajan
  Theoretical Computer Science, 96, 1, (1992) 35-72.

• Models and Logics for True Concurrency
  K Lodaya, M Mukund, R Ramanujam and P S Thiagarajan
  Sadhana 17, Part I, (1992) 131-165.

• Model checking time-constrained scenario-based specifications
  S Akshay, P Gastin, M Mukund and K Narayan Kumar
  Proc. FSTTCS 2010, LIPIcs Vol 8 (2010), 204-215.

• Specifying Interacting Components with Coordinated Concurrent Scenarios
  P Chandrasekaran and M Mukund
  Proc. SEFM 2009, IEEE (2009), 61-69.

• Tagging Make Local Testing of Message-Passing Systems Feasible
  P Bhateja and M Mukund
  Proc. SEFM 2008, IEEE (2008), 171-180.

• Distributed Timed Automata with Independently Evolving Clocks
  S Akshay, B Bollig, P Gastin, M Mukund and K Narayan Kumar
  Proc. CONCUR 2008, Springer LNCS 5201 (2008), 82-97.

• Checking Coverage for Infinite Collections of Timed Scenarios
  S Akshay, M Mukund and K Narayan Kumar
  Proc. CONCUR 2007, Springer LNCS 4703 (2007), 181-196.

• Local testing of message sequence charts is difficult
  P Bhateja, P Gastin, M Mukund and K Narayan Kumar
  Proc. FCT 2007, Springer LNCS 4639 (2007), 76-87.

• A Fresh Look at Testing for Asynchronous Communication
  P Bhateja, P Gastin and M Mukund
  Proc. ATVA 2006, Springer LNCS 4218 (2006), 369-383.

• Matching Scenarios with Timing Constraints
  P Chandrasekaran and M Mukund
  Proc. FORMATS 2006, Springer LNCS 4202 (2006) 98-112.

• Causal closure for MSC languages
  B Adsul, M Mukund, K Narayan Kumar and Vasumathi Narayanan
  Proc. FSTTCS 2005, Springer LNCS 3821 (2005) 335-347.

• Generic verification of security protocols
  A S Khan, M Mukund and S P Suresh
  Proc. SPIN '05, Springer LNCS 3639 (2005) 221-235.

• Local LTL with past constants is expressively complete for Mazurkiewicz traces
  P Gastin, M Mukund and K Narayan Kumar
  Proc. MFCS '03, Springer LNCS 2747 (2003) 429-438.

• Netcharts: Bridging the gap between HMSCs and executable specifications
  M Mukund, K Narayan Kumar and P S Thiagarajan
  Proc. CONCUR '03, Springer LNCS 2761 (2003) 296-310.

• Checking consistency of SDL+MSC specifications
  D D'Souza and M Mukund
  Proc. SPIN '03, Springer LNCS 2648 (2003) 151-165.

• Hereditary history preserving bisimulation is decidable for trace-labelled systems
  M Mukund
  Proc. FSTTCS '02, Springer LNCS 2556 (2002) 289-300.

• An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
  P Gastin and M Mukund
  Proc. ICALP '02, Springer LNCS 2382 (2002) 938-949.

• Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
  S Basu, M Mukund, C R Ramakrishnan, I V Ramakrishnan and R M Verma
  Proc. ICLP '01, Springer LNCS 2237 (2001) 166-180.

• Regular Collections of Message Sequence Charts
  J G Henriksen, M Mukund, K Narayan Kumar and P S Thiagarajan
  Proc. MFCS '00, Springer LNCS 1893 (2000) 405-414.

• Synthesizing Distributed Finite-State Systems from MSCs
  M Mukund, K Narayan Kumar and M Sohoni
  Proc. CONCUR '00, Springer LNCS 1877 (2000) 521-535.

• On Message Sequence Graphs and Finitely Generated Regular MSC Languages
  J G Henriksen, M Mukund, K Narayan Kumar and P S Thiagarajan
  Proc. ICALP '00, Springer LNCS 1853 (2000) 675-686.

• Faster Model Checking for Open Systems
  M Mukund, K Narayan Kumar and S A Smolka
  Proc. ASIAN '99, Springer LNCS 1742, (1999) 227-238.

• Synthesizing distributed transition systems from global specifications
  I Castellani, M Mukund and P S Thiagarajan
  Proc. FSTTCS 19, Springer LNCS 1739 (1999) 219-231.

• Towards a characterisation of finite-state message-passing systems
  M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
  Proc. ASIAN '98, Springer LNCS 1538 (1998) 282-299.

• Robust Asynchronous Protocols Are Finite-State
  M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
  Proc. ICALP '98, Springer LNCS 1443 (1998) 188-199.

• Determinizing Büchi Asynchronous Automata
  N Klarlund, M Mukund and M Sohoni
  Proc. FSTTCS 15, Springer LNCS 1026 (1995) 456-470.

• Keeping Track of the Latest Gossip in Message-Passing Systems
  M Mukund, K Narayan Kumar and M Sohoni
  Proc. STRICT '95, Workshops in Computing, Springer-Verlag (1995) 249-263.

• Determinizing Asynchronous Automata
  N Klarlund, M Mukund and M Sohoni
  Proc. ICALP '94, Springer LNCS 820 (1994) 130-141.

• Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice
  M Mukund and M Sohoni
  Proc. FSTTCS 13, Springer LNCS 761 (1993) 388-399.

• CCS, Locations and Asynchronous Transition Systems
  M Mukund and M Nielsen
  Proc. FSTTCS 12, Springer LNCS 652 (1992) 328-341.

• From global specifications to distributed implementations
  M Mukund
  Synthesis and Control of Discrete Event Systems, B. Caillaud, P. Darondeau, L. Lavagno (eds), Kluwer (2002) 19-34.
  Invited talk, Workshop on Synthesis of Concurrent Systems, a satellite event of the International Conference on Applications and Theory of Petri Nets (ICATPN'01), Newcastle, U.K., June 2001.

• Linear-Time Temporal Logic and Büchi Automata
  M Mukund
  Tutorial talk, Winter School on Logic and Computer Science, ISI, Calcutta, January 1997.

• Linear Time Temporal Logics over Mazurkiewicz Traces
  M Mukund and P S Thiagarajan
  Proc. MFCS '96, Springer LNCS 1113, (1996) 32-62.

• Finite-state Automata on Infinite Inputs
  M Mukund
  Tutorial talk, NSTCS 6, Banasthali Vidyapith, Banasthali Rajasthan, August 1996.

• Generic verification of security protocols
  A S Khan, M Mukund and S P Suresh
  Internal Report, Chennai Mathematical Institute, Chennai, India (2005).

• Message-Passing Automata and Asynchronous Communication
  M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
  Report TCS-97-4, SPIC Mathematical Institute, Madras, India (1997).

• Implementing Causal Ordering with Bounded Time-stamps
  Saileshwar Krishnamurthy and M Mukund
  Report TCS-95-7, School of Mathematics, SPIC Science Foundation, Madras, India (1995).

• Gossiping, Asynchronous Automata and Zielonka's Theorem
  M Mukund and M Sohoni
  Report TCS-94-2, School of Mathematics, SPIC Science Foundation, Madras, India (1994).

• Transition System Models for Concurrency
  M Mukund
  Report TCS-92-3, School of Mathematics, SPIC Science Foundation, Madras, India (1992).