Petri nets and step transition systems M Mukund International Journal of Foundations of Computer Science 3 (04), 443-478, 1992 | 185 | 1992 |

A theory of regular MSC languages JG Henriksen, M Mukund, KN Kumar, M Sohoni, PS Thiagarajan Information and computation 202 (1), 1-38, 2005 | 126 | 2005 |

On message sequence graphs and finitely generated regular MSC languages JG Henriksen, M Mukund, KN Kumar, PS Thiagarajan Automata, Languages and Programming: 27th International Colloquium, ICALP …, 2000 | 98 | 2000 |

Synthesizing distributed finite-state systems from MSCs M Mukund, KN Kumar, M Sohoni International Conference on Concurrency Theory, 521-535, 2000 | 76 | 2000 |

CCS, locations and asynchronous transition systems M Mukund, M Nielsen International Conference on Foundations of Software Technology and …, 1992 | 76 | 1992 |

Regular collections of message sequence charts JG Henriksen, M Mukund, KN Kumar, PS Thiagarajan International Symposium on Mathematical Foundations of Computer Science, 405-414, 2000 | 70 | 2000 |

From global specifications to distributed implementations M Mukund Synthesis and control of discrete event systems, 19-35, 2002 | 65 | 2002 |

Keeping track of the latest gossip in a distributed system M Mukund, M Sohoni Distributed Computing 10, 137-148, 1997 | 50 | 1997 |

Synthesizing distributed transition systems from global specifications I Castellani, M Mukund, PS Thiagarajan International Conference on Foundations of Software Technology and …, 1999 | 48 | 1999 |

Distributed timed automata with independently evolving clocks S Akshay, B Bollig, P Gastin, M Mukund, K Narayan Kumar International Conference on Concurrency Theory, 82-97, 2008 | 46 | 2008 |

Linear time temporal logics over Mazurkiewicz traces M Mukund, PS Thiagarajan International Symposium on Mathematical Foundations of Computer Science, 62-92, 1996 | 45 | 1996 |

Linear-time temporal logic and Büchi automata M Mukund Tutorial talk, Winter School on Logic and Computer Science, Indian …, 1997 | 37 | 1997 |

Finite-state automata on infinite inputs M Mukund Tcs 96, 2, 1996 | 37 | 1996 |

A logical characterization of well branching event structures M Mukund, PS Thiagarajan Theoretical Computer Science 96 (1), 35-72, 1992 | 34 | 1992 |

Models and logics for true concurrency K Lodaya, M Mukund, R Ramanujam, PS Thiagarajan Sadhana 17, 131-165, 1992 | 34 | 1992 |

Local and symbolic bisimulation using tabled constraint logic programming S Basu, M Mukund, CR Ramakrishnan, IV Ramakrishnan, R Verma Logic Programming: 17thInternational Conference, ICLP 2001 Paphos, Cyprus …, 2001 | 32 | 2001 |

Causal closure for MSC languages B Adsul, M Mukund, KN Kumar, V Narayanan FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005 | 31 | 2005 |

Determinizing asynchronous automata N Klarlund, M Mukund, M Sohoni Automata, Languages and Programming: 21st International Colloquium, ICALP 94 …, 1994 | 30 | 1994 |

Netcharts: Bridging the gap between HMSCs and executable specifications M Mukund, KN Kumar, PS Thiagarajan CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003 | 29 | 2003 |

An axiomatization of event structures M Mukund, PS Thiagarajan International Conference on Foundations of Software Technology and …, 1989 | 29 | 1989 |