default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMadhavan Mukund
Person information
- affiliation: Chennai Mathematical Institute (CMI), India
- affiliation: SPIC Science Foundation, School of Mathematics, Madras, India
- affiliation (PhD 1992): Aarhus University, Denmark
- affiliation: Institute of Mathematical Sciences, Madras, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c49]Dan Garcia
, Sonia Garcha, Madhavan Mukund, Vipul Shah:
Best Practices for Developing Computational Thinking. CompEd (2) 2023: 183-184- [c48]Madhavan Mukund, Adwitee Roy, B. Srivathsan:
A Local-Time Semantics for Negotiations. FORMATS 2023: 105-121 - [i3]Madhavan Mukund, Adwitee Roy, B. Srivathsan:
A Local-Time Semantics for Negotiations. CoRR abs/2307.06691 (2023) - 2022
- [j9]Jayakrishnan Warriem, Andrew Thangaraj, Madhavan Mukund, Bharathi Balaji:
Digital interventions at scale: lessons from NPTEL and IIT Madras B.S. degree program. Commun. ACM 65(11): 54-57 (2022) - 2021
- [c47]Rupak Majumdar, Madhavan Mukund, Felix Stutz, Damien Zufferey:
Generalising Projection in Asynchronous Multiparty Session Types. CONCUR 2021: 35:1-35:24 - [i2]Rupak Majumdar, Madhavan Mukund, Felix Stutz, Damien Zufferey:
Generalising Projection in Asynchronous Multiparty Session Types. CoRR abs/2107.03984 (2021) - 2020
- [c46]Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Bounded Version Vectors Using Mazurkiewicz Traces. ACSS (1) 2020: 31-42 - [c45]Ahmed Bouajjani, Constantin Enea, Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Formalizing and Checking Multilevel Consistency. VMCAI 2020: 379-400
2010 – 2019
- 2019
- [j8]Meena Mahajan, Madhavan Mukund, Nitin Saxena:
Research in theoretical computer science. Commun. ACM 62(11): 92-95 (2019) - 2018
- [c44]Ahmed Bouajjani, Constantin Enea, Madhavan Mukund, Rajarshi Roy:
On Verifying TSO Robustness for Event-Driven Asynchronous Programs. NETYS 2018: 225-239 - 2017
- [c43]Abdullah Abdul Khadir, Madhavan Mukund, S. P. Suresh:
Knowledge Transfer and Information Leakage in Protocols. ATVA 2017: 225-240 - 2016
- [c42]Ratul Saha, Madhavan Mukund, R. P. Jagadeesh Chandra Bose:
Time-Bounded Statistical Analysis of Resource-Constrained Business Processes with Distributed Probabilistic Systems. SETTA 2016: 297-314 - 2015
- [j7]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594: 24-43 (2015) - [c41]Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Effective Verification of Replicated Data Types Using Later Appearance Records (LAR). ATVA 2015: 293-308 - [c40]Ratul Saha, Javier Esparza, Sumit Kumar Jha, Madhavan Mukund, P. S. Thiagarajan:
Distributed Markov Chains. VMCAI 2015: 117-134 - [c39]Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Bounded Implementations of Replicated Data Types. VMCAI 2015: 355-372 - 2014
- [j6]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130(4): 377-407 (2014) - [c38]S. Akshay, Loïc Hélouët, Madhavan Mukund:
Sessions with an Unbounded Number of Agents. ACSD 2014: 166-175 - [c37]Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Optimized OR-Sets without Ordering Constraints. ICDCN 2014: 227-241 - [i1]Sumit Kumar Jha, Madhavan Mukund, Ratul Saha, P. S. Thiagarajan:
Distributed Markov Chains. CoRR abs/1408.0979 (2014) - 2012
- [p3]Madhavan Mukund:
Finite-State Automata on Infinite Inputs. Modern Applications of Automata Theory 2012: 45-78 - [p2]Madhavan Mukund:
Automata on Distributed Alphabets. Modern Applications of Automata Theory 2012: 257-288 - [e4]Supratik Chakraborty, Madhavan Mukund:
Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7561, Springer 2012, ISBN 978-3-642-33385-9 [contents] - 2011
- [c36]Philippe Darondeau, Loïc Hélouët, Madhavan Mukund:
Assembling Sessions. ATVA 2011: 259-274 - [c35]Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade:
Kleene Theorems for Product Systems. DCFS 2011: 235-247 - 2010
- [c34]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Model checking time-constrained scenario-based specifications. FSTTCS 2010: 204-215
2000 – 2009
- 2009
- [c33]Prakash Chandrasekaran, Madhavan Mukund:
Specifying Interacting Components with Coordinated Concurrent Scenarios. SEFM 2009: 61-69 - 2008
- [c32]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - [c31]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: 10 - [c30]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: i - [c29]Puneet Bhateja, Madhavan Mukund:
Tagging Make Local Testing of Message-Passing Systems Feasible. SEFM 2008: 171-180 - [e3]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. LIPIcs 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2008 [contents] - 2007
- [c28]Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan, Shaofa Yang:
Anchored Concatenation of MSCs. Formal Models, Languages and Applications 2007: 274-288 - [c27]S. Akshay, Madhavan Mukund, K. Narayan Kumar:
Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR 2007: 181-196 - [c26]Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult. FCT 2007: 76-87 - [e2]Madhavan Mukund, K. Rangarajan, K. G. Subramanian:
Formal Models, Languages and Applications [this volume commemorates the 75th birthday of Prof. Rani Siromoney]. Series in Machine Perception and Artificial Intelligence 66, World Scientific 2007, ISBN 978-981-256-889-2 [contents] - 2006
- [c25]Puneet Bhateja, Paul Gastin, Madhavan Mukund:
A Fresh Look at Testing for Asynchronous Communication. ATVA 2006: 369-383 - [c24]Prakash Chandrasekaran, Madhavan Mukund:
Matching Scenarios with Timing Constraints. FORMATS 2006: 98-112 - 2005
- [j5]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) - [c23]Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan:
Causal Closure for MSC Languages. FSTTCS 2005: 335-347 - [c22]Abdul Sahid Khan, Madhavan Mukund, S. P. Suresh:
Generic Verification of Security Protocols. SPIN 2005: 221-235 - 2003
- [j4]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1): 221-239 (2003) - [c21]Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
Netcharts: Bridging the gap between HMSCs and executable specifications. CONCUR 2003: 293-307 - [c20]Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. MFCS 2003: 429-438 - [c19]Deepak D'Souza, Madhavan Mukund:
Checking Consistency of SDL+MSC Specifications. SPIN 2003: 151-165 - 2002
- [c18]Madhavan Mukund:
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems. FSTTCS 2002: 289-300 - [c17]Paul Gastin, Madhavan Mukund:
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. ICALP 2002: 938-949 - 2001
- [c16]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 - [e1]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. Lecture Notes in Computer Science 2245, Springer 2001, ISBN 3-540-43002-4 [contents] - 2000
- [c15]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Synthesizing Distributed Finite-State Systems from MSCs. CONCUR 2000: 521-535 - [c14]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 - [c13]Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
Regular Collections of Message Sequence Charts. MFCS 2000: 405-414
1990 – 1999
- 1999
- [c12]Madhavan Mukund, K. Narayan Kumar, Scott A. Smolka:
Faster Model Checking for Open Systems. ASIAN 1999: 227-238 - [c11]Ilaria Castellani, Madhavan Mukund, P. S. Thiagarajan:
Synthesizing Distributed Transition Systems from Global Specification. FSTTCS 1999: 219-231 - 1998
- [c10]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Towards a Characterisation of Finite-State Message-Passing Systems. ASIAN 1998: 282-299 - [c9]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Robust Asynchronous Protocols Are Finite-State. ICALP 1998: 188-199 - 1997
- [j3]Madhavan Mukund, Milind A. Sohoni:
Keeping Track of the Latest Gossip in a Distributed System. Distributed Comput. 10(3): 137-148 (1997) - 1996
- [c8]Madhavan Mukund, P. S. Thiagarajan:
Linear time temporal logics over Mazurkiewicz traces. Partial Order Methods in Verification 1996: 171-201 - [c7]Madhavan Mukund, P. S. Thiagarajan:
Linear Time Temporal Logics over Mazurkiewicz Traces. MFCS 1996: 62-92 - 1995
- [c6]Nils Klarlund, Madhavan Mukund, Milind A. Sohoni:
Determinizing Büchi Asnchronous Automata. FSTTCS 1995: 456-470 - [c5]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Keeping Track of the Latest Gossip in Message-Passing Systems. STRICT 1995: 249-263 - 1994
- [c4]Nils Klarlund, Madhavan Mukund, Milind A. Sohoni:
Determinizing Asynchronous Automata. ICALP 1994: 130-141 - 1993
- [c3]Madhavan Mukund, Milind A. Sohoni:
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. FSTTCS 1993: 388-399 - 1992
- [j2]Madhavan Mukund:
Petri Nets and Step Transition Systems. Int. J. Found. Comput. Sci. 3(4): 443-478 (1992) - [j1]Madhavan Mukund, P. S. Thiagarajan:
A Logical Characterization of Well Branching Event Structures. Theor. Comput. Sci. 96(1): 35-72 (1992) - [c2]Madhavan Mukund, Mogens Nielsen:
CCS, Location and Asynchronous Transition Systems. FSTTCS 1992: 328-341
1980 – 1989
- 1989
- [c1]Madhavan Mukund, P. S. Thiagarajan:
An Axiomatization of Event Structures. FSTTCS 1989: 143-160 - [p1]Madhavan Mukund, P. S. Thiagarajan:
A Petri Net Model of Asynchronously Communicating Sequential Processes. A Perspective in Theoretical Computer Science 1989: 165-198
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
