 | 2009 |
|---|
| 37 |       | Prakash Chandrasekaran,
Madhavan Mukund:
Specifying Interacting Components with Coordinated Concurrent Scenarios.
SEFM 2009: 61-69 |
| 2008 |
|---|
| 36 |  | Ramesh Hariharan,
Madhavan Mukund,
V. Vinay:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2008 |
| 35 | | S. Akshay,
Benedikt Bollig,
Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks.
CONCUR 2008: 82-97 |
| 34 | | Ramesh Hariharan,
Madhavan Mukund,
V. Vinay:
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
FSTTCS 2008: 10 |
| 33 | | Ramesh Hariharan,
Madhavan Mukund,
V. Vinay:
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
FSTTCS 2008: i |
| 32 | | Puneet Bhateja,
Madhavan Mukund:
Tagging Make Local Testing of Message-Passing Systems Feasible.
SEFM 2008: 171-180 |
| 2007 |
|---|
| 31 | | S. Akshay,
Madhavan Mukund,
K. Narayan Kumar:
Checking Coverage for Infinite Collections of Timed Scenarios.
CONCUR 2007: 181-196 |
| 30 | | Puneet Bhateja,
Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult.
FCT 2007: 76-87 |
| 2006 |
|---|
| 29 | | Puneet Bhateja,
Paul Gastin,
Madhavan Mukund:
A Fresh Look at Testing for Asynchronous Communication.
ATVA 2006: 369-383 |
| 28 | | Prakash Chandrasekaran,
Madhavan Mukund:
Matching Scenarios with Timing Constraints.
FORMATS 2006: 98-112 |
| 2005 |
|---|
| 27 | | Bharat Adsul,
Madhavan Mukund,
K. Narayan Kumar,
Vasumathi Narayanan:
Causal Closure for MSC Languages.
FSTTCS 2005: 335-347 |
| 26 | | Abdul Sahid Khan,
Madhavan Mukund,
S. P. Suresh:
Generic Verification of Security Protocols.
SPIN 2005: 221-235 |
| 25 | | Jesper G. Henriksen,
Madhavan Mukund,
K. Narayan Kumar,
Milind A. Sohoni,
P. S. Thiagarajan:
A theory of regular MSC languages.
Inf. Comput. 202(1): 1-38 (2005) |
| 2003 |
|---|
| 24 | | Madhavan Mukund,
K. Narayan Kumar,
P. S. Thiagarajan:
Netcharts: Bridging the gap between HMSCs and executable specifications.
CONCUR 2003: 293-307 |
| 23 | | Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
MFCS 2003: 429-438 |
| 22 | | Deepak D'Souza,
Madhavan Mukund:
Checking Consistency of SDL+MSC Specifications.
SPIN 2003: 151-165 |
| 21 | | Madhavan Mukund,
K. Narayan Kumar,
Milind A. Sohoni:
Bounded time-stamping in message-passing systems.
Theor. Comput. Sci. 290(1): 221-239 (2003) |
| 2002 |
|---|
| 20 | | Madhavan Mukund:
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems.
FSTTCS 2002: 289-300 |
| 19 | | Paul Gastin,
Madhavan Mukund:
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.
ICALP 2002: 938-949 |
| 2001 |
|---|
| 18 | | Ramesh Hariharan,
Madhavan Mukund,
V. Vinay:
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings
Springer 2001 |
| 17 | | Samik Basu,
Madhavan Mukund,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Rakesh M. Verma:
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming.
ICLP 2001: 166-180 |
| 2000 |
|---|
| 16 | | Madhavan Mukund,
K. Narayan Kumar,
Milind A. Sohoni:
Synthesizing Distributed Finite-State Systems from MSCs.
CONCUR 2000: 521-535 |
| 15 | | Jesper G. Henriksen,
Madhavan Mukund,
K. Narayan Kumar,
P. S. Thiagarajan:
On Message Sequence Graphs and Finitely Generated Regular MSC Languages.
ICALP 2000: 675-686 |
| 14 | | Jesper G. Henriksen,
Madhavan Mukund,
K. Narayan Kumar,
P. S. Thiagarajan:
Regular Collections of Message Sequence Charts.
MFCS 2000: 405-414 |
| 1999 |
|---|
| 13 | | Madhavan Mukund,
K. Narayan Kumar,
Scott A. Smolka:
Faster Model Checking for Open Systems.
ASIAN 1999: 227-238 |
| 12 | | Ilaria Castellani,
Madhavan Mukund,
P. S. Thiagarajan:
Synthesizing Distributed Transition Systems from Global Specification.
FSTTCS 1999: 219-231 |
| 1998 |
|---|
| 11 | | Madhavan Mukund,
K. Narayan Kumar,
Jaikumar Radhakrishnan,
Milind A. Sohoni:
Towards a Characterisation of Finite-State Message-Passing Systems.
ASIAN 1998: 282-299 |
| 10 | | Madhavan Mukund,
K. Narayan Kumar,
Jaikumar Radhakrishnan,
Milind A. Sohoni:
Robust Asynchronous Protocols Are Finite-State.
ICALP 1998: 188-199 |
| 1997 |
|---|
| 9 | | Madhavan Mukund,
Milind A. Sohoni:
Keeping Track of the Latest Gossip in a Distributed System.
Distributed Computing 10(3): 137-148 (1997) |
| 1996 |
|---|
| 8 | | Madhavan Mukund,
P. S. Thiagarajan:
Linear Time Temporal Logics over Mazurkiewicz Traces.
MFCS 1996: 62-92 |
| 1995 |
|---|
| 7 | | Nils Klarlund,
Madhavan Mukund,
Milind A. Sohoni:
Determinizing Büchi Asnchronous Automata.
FSTTCS 1995: 456-470 |
| 1994 |
|---|
| 6 | | Nils Klarlund,
Madhavan Mukund,
Milind A. Sohoni:
Determinizing Asynchronous Automata.
ICALP 1994: 130-141 |
| 1993 |
|---|
| 5 | | Madhavan Mukund,
Milind A. Sohoni:
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice.
FSTTCS 1993: 388-399 |
| 1992 |
|---|
| 4 | | Madhavan Mukund,
Mogens Nielsen:
CCS, Location and Asynchronous Transition Systems.
FSTTCS 1992: 328-341 |
| 3 | | Madhavan Mukund:
Petri Nets and Step Transition Systems.
Int. J. Found. Comput. Sci. 3(4): 443-478 (1992) |
| 2 | | Madhavan Mukund,
P. S. Thiagarajan:
A Logical Characterization of Well Branching Event Structures.
Theor. Comput. Sci. 96(1): 35-72 (1992) |
| 1989 |
|---|
| 1 | | Madhavan Mukund,
P. S. Thiagarajan:
An Axiomatization of Event Structures.
FSTTCS 1989: 143-160 |
