Publications

Papers related to asynchronous automata and trace theory

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

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

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

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

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

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

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

• 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