Publications

Papers related to message-passing systems

• 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.

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

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

• 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.

• 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.

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

• 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.

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

• 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.

• 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.

• 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.

• Counter 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)

• Click here for a complete list of papers.

• Subject-wise classification
  • 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
  • Automated verification
  • Computer Security