Time-bounded Statistical Analysis of
Resource-constrained Business Processes with Distributed
Probabilistic Systems
R Saha, M Mukund and R P J C Bose
Proc. SETTA 2016, Springer LNCS (2016) to appear.
Checking conformance for time-constrained scenario-based
specifications
S Akshay, P Gastin, M Mukund and K Narayan Kumar
Theoretical Computer Science 594 (2015) 24-43.
Effective verification of Replicated Data Types using
Later Appearance Records (LAR)
M Mukund, Gautham Shenoy R and S P Suresh
Proc. ATVA 2015, Springer LNCS 9364 (2015) 293-308.
Bounded Implementations of Replicated Data Types
M Mukund, Gautham Shenoy R and S P Suresh
Proc. VMCAI 2015, Springer LNCS 8931 (2015) 355-372.
Distributed Markov Chains
R Saha, J Esparza, S K Jha, M Mukund, R Saha and P S Thiagarajan
Proc. VMCAI 2015, Springer LNCS 8931 (2015) 117-134.
Sessions with an unbounded number of agents
S Akshay, L Hélouët and M Mukund
Proc. ACSD 2014, IEEE (2014) 166-175.
Optimized OR-Sets Without Ordering Constraints
M Mukund, Gautham Shenoy R and S P Suresh
Proc. ICDCN 2014, Springer LNCS 8314 (2014) 227-241.
Distributed Timed Automata with Independently Evolving Clocks
S Akshay, B Bollig, P Gastin, M Mukund and K Narayan Kumar
Fundamenta Informaticae. 130(4) (2014) 377-407
Assembling Sessions
P Darondeau, L Hélouët and M Mukund
Proc. ATVA 2011, Springer LNCS 6996 (2011) 259-274.
Kleene theorems for product systems
K Lodaya, M Mukund and R Phawade
Proc. DCFS 2011, Springer LNCS 6808 (2011) 235-247.
Model checking time-constrained scenario-based specifications
S Akshay, P Gastin, M Mukund and K Narayan Kumar
Proc. FSTTCS 2010, liPIcs Vol 8 (2010), 204-215.
Specifying Interacting Components with Coordinated Concurrent Scenarios
P Chandrasekaran and M Mukund
Proc. SEFM 2009, IEEE (2009), 61-69.
Tagging Make Local Testing of Message-Passing Systems Feasible
P Bhateja and M Mukund
Proc. SEFM 2008, IEEE (2008), 171-180.
Distributed Timed Automata with Independently Evolving Clocks
S Akshay, B Bollig, P Gastin, M Mukund and K Narayan Kumar
Proc. CONCUR 2008, Springer LNCS 5201 (2008), 82-97.
Checking Coverage for Infinite Collections of Timed Scenarios
S Akshay, M Mukund and K Narayan Kumar
Proc. CONCUR 2007, Springer LNCS 4703 (2007), 181-196.
Local testing of message sequence charts is difficult
P Bhateja, P Gastin, M Mukund and K Narayan Kumar
Proc. FCT 2007, Springer LNCS 4639 (2007), 76-87.
A Fresh Look at Testing for Asynchronous Communication
P Bhateja, P Gastin and M Mukund
Proc. ATVA 2006, Springer LNCS 4218 (2006), 369-383.
Matching Scenarios with Timing Constraints
P Chandrasekaran and M Mukund
Proc. FORMATS 2006, Springer LNCS 4202 (2006) 98-112.
A Theory of Regular MSC Languages
J G Henriksen, M Mukund, K Narayan Kumar, M Sohoni and P S Thiagarjan
Information and Computation, 202(1), (2005), 1--38.
Causal closure for MSC languages
B Adsul, M Mukund, K Narayan Kumar and Vasumathi Narayanan
Proc. FSTTCS 2005, Springer LNCS 3821 (2005) 335-347.
Generic verification of security protocols
A S Khan, M Mukund and S P Suresh
Proc. SPIN '05, Springer LNCS 3639 (2005) 221-235.
Bounded time-stamping in message-passing systems
M Mukund, K Narayan Kumar and M Sohoni
Theoretical Computer Science, 290(1), (2003), 221-239.
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.
Netcharts: Bridging the gap between HMSCs and executable
specifications
M Mukund, K Narayan Kumar and P S Thiagarajan
Proc. CONCUR '03, Springer LNCS 2761 (2003) 296-310.
Checking consistency of SDL+MSC specifications
D D'Souza and M Mukund
Proc. SPIN '03, Springer LNCS 2648 (2003) 151-165.
Hereditary history preserving bisimulation is decidable for
trace-labelled systems
M Mukund
Proc. FSTTCS '02, Springer LNCS 2556 (2002) 289-300.
An Elementary Expressively Complete Temporal Logic for
Mazurkiewicz Traces
P Gastin and M Mukund
Proc. ICALP '02, Springer LNCS 2382 (2002) 938-949.
Local and Symbolic Bisimulation
Using Tabled Constraint Logic Programming
S Basu, M Mukund, C R Ramakrishnan, I V Ramakrishnan
and R M Verma
Proc. ICLP '01, Springer LNCS 2237 (2001) 166-180.
Regular Collections of Message Sequence Charts
J G Henriksen, M Mukund, K Narayan Kumar and P S Thiagarajan
Proc. MFCS '00, Springer LNCS 1893 (2000) 405-414.
Synthesizing Distributed Finite-State Systems from MSCs
M Mukund, K Narayan Kumar and M Sohoni
Proc. CONCUR '00, Springer LNCS 1877 (2000) 521-535.
On Message Sequence Graphs and Finitely
Generated Regular MSC Languages
J G Henriksen, M Mukund, K Narayan Kumar and P S Thiagarajan
Proc. ICALP '00, Springer LNCS 1853 (2000) 675-686.
Faster Model Checking for Open Systems
M Mukund, K Narayan Kumar and S A Smolka
Proc. ASIAN '99, Springer LNCS 1742, (1999) 227-238.
Synthesizing distributed transition systems from global
specifications
I Castellani, M Mukund and P S Thiagarajan
Proc. FSTTCS 19, Springer LNCS 1739 (1999) 219-231.
Towards a characterisation of finite-state
message-passing systems
M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
Proc. ASIAN '98, Springer LNCS 1538 (1998) 282-299.
Robust Asynchronous Protocols Are Finite-State
M Mukund, K Narayan Kumar, J Radhakrishnan and M Sohoni
Proc. ICALP '98, Springer LNCS 1443 (1998) 188-199.
Keeping Track of the Latest Gossip in a Distributed System
M Mukund and M Sohoni
Distributed Computing, 10, 3, (1997) 137-148.
Determinizing Büchi Asynchronous Automata
N Klarlund, M Mukund and M Sohoni
Proc. FSTTCS 15, Springer LNCS 1026 (1995) 456-470.
Keeping Track of the Latest Gossip in Message-Passing Systems
M Mukund, K Narayan Kumar and M Sohoni
Proc. STRICT '95, Workshops in Computing, Springer-Verlag
(1995) 249-263.
Determinizing Asynchronous Automata
N Klarlund, M Mukund and M Sohoni
Proc. ICALP '94, Springer LNCS 820 (1994) 130-141.
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice
M Mukund and M Sohoni
Proc. FSTTCS 13, Springer LNCS 761 (1993) 388-399.
Petri Nets and Step Transition Systems
M Mukund
International Journal of Foundations of Computer Science
3, 4, (1992) 443-478.
A Logical Characterization of Well Branching Event Structures
M Mukund and P S Thiagarajan
Theoretical Computer Science, 96, 1, (1992) 35-72.
Models and Logics for True Concurrency
K Lodaya, M Mukund, R Ramanujam and P S Thiagarajan
Sadhana 17, Part I, (1992) 131-165.
CCS, Locations and Asynchronous Transition Systems
M Mukund and M Nielsen
Proc. FSTTCS 12, Springer LNCS 652 (1992) 328-341.
Proc 10th International Symposium on Automated
Technology for Verification and Analysis (ATVA 2012)
S Chakraborty and M Mukund (eds.):
Springer Lecture Notes in Computer Science,
7561, (2012).
Proc 28th International Conference on
Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2008)
R Hariharan, M Mukund and V Vinay (eds.)
Leibniz International Proceedings in Informatcs (LIPICS),
2 (2008).
Perspectives in Concurrency Theory
K Lodaya, M Mukund and R Ramanujam (eds.)
Universities Press (2008).
Formal Models, Languages and Applications
K G Subramanian, K Rangarajan and M Mukund (eds.)
World Scientific (2006)
Proc 21st International Conference on
Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001)
R Hariharan, M Mukund and V Vinay (eds.)
Springer Lecture Notes in Computer Science,
2257, (2001).
Reachability and boundedness in time-constrained MSC graphs
P Gastin, M Mukund and K Narayan Kumar
Perspectives in Concurrency Theory
K Lodaya, M Mukund and R Ramanujam (eds.),
Universities Press (2008) 157-183.
Adding time to scenarios
P Chandrasekaran and M Mukund
Next Generation Design and Verification Methodologies
for Distributed Embedded Control Systems
S Ramesh and P Sampath (eds.),
Springer (2007) 83-97.
Anchored Concatenation of MSCs
M Mukund, K Narayan Kumar, P S Thiagarajan and Shaofa Yang
Formal models, languages and applications
K G Subramanian, K Rangarajan and M Mukund (eds.),
World Scientific (2006) 274-288.
From global specifications to distributed implementations
M Mukund
Synthesis and Control of Discrete Event Systems
B Caillaud, P Darondeau, L Lavagno (eds),
Kluwer (2002) 19-34.
Invited talk, Workshop on Synthesis of
Concurrent Systems,
a satellite event of the
International Conference on Applications and Theory of Petri
Nets (ICATPN'01), Newcastle, UK, June 2001.