Madhavan Mukund

Orcid: 0000-0001-8563-7454

Affiliations:
  • Chennai Mathematical Institute (CMI), India
  • SPIC Science Foundation, School of Mathematics, Madras, India
  • Aarhus University, Denmark (PhD 1992)
  • Institute of Mathematical Sciences, Madras, India


According to our database1, Madhavan Mukund authored at least 60 papers between 1989 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Local-Time Semantics for Negotiations.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2023

Best Practices for Developing Computational Thinking.
Proceedings of the ACM Conference on Global Computing Education Vol 2, 2023

2022
Digital interventions at scale: lessons from NPTEL and IIT Madras B.S. degree program.
Commun. ACM, 2022

2021
Generalising Projection in Asynchronous Multiparty Session Types.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Formalizing and Checking Multilevel Consistency.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Bounded Version Vectors Using Mazurkiewicz Traces.
Proceedings of the Advanced Computing and Systems for Security, 2020

2019
Research in theoretical computer science.
Commun. ACM, 2019

2018
On Verifying TSO Robustness for Event-Driven Asynchronous Programs.
Proceedings of the Networked Systems - 6th International Conference, 2018

2017
Knowledge Transfer and Information Leakage in Protocols.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
Time-Bounded Statistical Analysis of Resource-Constrained Business Processes with Distributed Probabilistic Systems.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2016

2015
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci., 2015

Distributed Markov Chains.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Bounded Implementations of Replicated Data Types.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Effective Verification of Replicated Data Types Using Later Appearance Records (LAR).
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Informaticae, 2014

Distributed Markov Chains.
CoRR, 2014

Optimized OR-Sets without Ordering Constraints.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Sessions with an Unbounded Number of Agents.
Proceedings of the 14th International Conference on Application of Concurrency to System Design, 2014

2012
Automata on Distributed Alphabets.
Proceedings of the Modern Applications of Automata Theory., 2012

Finite-State Automata on Infinite Inputs.
Proceedings of the Modern Applications of Automata Theory., 2012

2011
Kleene Theorems for Product Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Assembling Sessions.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Model checking time-constrained scenario-based specifications.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Specifying Interacting Components with Coordinated Concurrent Scenarios.
Proceedings of the Seventh IEEE International Conference on Software Engineering and Formal Methods, 2009

2008
Tagging Make Local Testing of Message-Passing Systems Feasible.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007
Local Testing of Message Sequence Charts Is Difficult.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Checking Coverage for Infinite Collections of Timed Scenarios.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Anchored Concatenation of MSCs.
Proceedings of the Formal Models, 2007

2006
Matching Scenarios with Timing Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

A Fresh Look at Testing for Asynchronous Communication.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
A theory of regular MSC languages.
Inf. Comput., 2005

Generic Verification of Security Protocols.
Proceedings of the Model Checking Software, 2005

Causal Closure for MSC Languages.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2003
Bounded time-stamping in message-passing systems.
Theor. Comput. Sci., 2003

Checking Consistency of SDL+MSC Specifications.
Proceedings of the Model Checking Software, 2003

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Netcharts: Bridging the gap between HMSCs and executable specifications.
Proceedings of the CONCUR 2003, 2003

2002
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming.
Proceedings of the Logic Programming, 17th International Conference, 2001

2000
Regular Collections of Message Sequence Charts.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On Message Sequence Graphs and Finitely Generated Regular MSC Languages.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Synthesizing Distributed Finite-State Systems from MSCs.
Proceedings of the CONCUR 2000, 2000

1999
Synthesizing Distributed Transition Systems from Global Specification.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Faster Model Checking for Open Systems.
Proceedings of the Advances in Computing Science, 1999

1998
Robust Asynchronous Protocols Are Finite-State.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Towards a Characterisation of Finite-State Message-Passing Systems.
Proceedings of the Advances in Computing Science, 1998

1997
Keeping Track of the Latest Gossip in a Distributed System.
Distributed Comput., 1997

1996
Linear Time Temporal Logics over Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
Keeping Track of the Latest Gossip in Message-Passing Systems.
Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

Determinizing Büchi Asnchronous Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994
Determinizing Asynchronous Automata.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
A Logical Characterization of Well Branching Event Structures.
Theor. Comput. Sci., 1992

Petri Nets and Step Transition Systems.
Int. J. Found. Comput. Sci., 1992

CCS, Location and Asynchronous Transition Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1989
A Petri Net Model of Asynchronously Communicating Sequential Processes.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

An Axiomatization of Event Structures.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989


  Loading...