Items where Author is "Narayan Kumar, K."

Akshay, S. ; Gastin, Paul ; Mukund, Madhavan ; Narayan Kumar, K. (2015) Checking conformance for time-constrained scenario-based specifications Theoretical Computer Science, 594 . pp. 24-43. ISSN 0304-3975

Akshay, S. ; Gastin, Paul ; Mukund, Madhavan ; Narayan Kumar, K. (2010) Model checking time-constrained scenario-based specifications In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), 15-18 Dec 2010, Chennai, India.

Akshay, S. ; Bollig, Benedikt ; Gastin, Paul ; Mukund, Madhavan ; Narayan Kumar, K. (2008) Distributed timed automata with independently evolving clocks In: 19th International Conference on Concurrency Theory, CONCUR 2008, 19-22 Aug 2008, Toronto, Canada.

Akshay, S. ; Mukund, Madhavan ; Narayan Kumar, K. (2007) Checking coverage for infinite collections of timed scenarios In: 18th International Conference on Concurrency Theory, CONCUR 2007, 03-08 Sep 2007, Lisbon, Portugal.

Bhateja, Puneet ; Gastin, Paul ; Mukund, Madhavan ; Narayan Kumar, K. (2007) Local testing of message sequence charts is difficult In: 16th International Symposium on Fundamentals of Computation Theory, FCT 2007, 27-30 Aug 2007, Budapest, Hungary.

Henriksen, Jesper G. ; Mukund, Madhavan ; Narayan Kumar, K. ; Sohoni, Milind ; Thiagarajan, P. S. (2005) A theory of regular MSC languages Information and Computation, 202 (1). pp. 1-38. ISSN 0890-5401

Adsul, Bharat ; Mukund, Madhavan ; Narayan Kumar, K. ; Narayanan, Vasumathi (2005) Causal closure for MSC languages In: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005, 15-18 Dec 2005, Hyderabad, India.

Mukund, Madhavan ; Narayan Kumar, K. ; Sohoni, Milind (2003) Bounded time-stamping in message-passing systems Theoretical Computer Science, 290 (1). pp. 221-239. ISSN 0304-3975

Gastin, Paul ; Mukund, Madhavan ; Narayan Kumar, K. (2003) Local LTL with past constants is expressively complete for Mazurkiewicz traces In: 28th International Symposium of Mathematical Foundations of Computer Science (MCFS-2003), 25-29 Aug 2003, Bratislava, Slovakia.

Mukund, Madhavan ; Narayan Kumar, K. ; Thiagarajan, P. S. (2003) Netcharts: bridging the gap between HMSCs and executable specifications In: 14th International Conference on Concurrency Theory, 3-5 Sep 2003, Marseille, France.

Henriksen, Jesper G. ; Mukund, Madhavan ; Narayan Kumar, K. ; Thiagarajan, P. S. (2002) On message sequence graphs and finitely generated regular MSC languages In: 27th International Colloquium on Automata, Languages, and Programming (ICALP 2000), 09-15 Jul 2000, Geneva, Switzerland.

Henriksen, Jesper G. ; Mukund, Madhavan ; Narayan Kumar, K. ; Thiagarajan, P. S. (2001) Regular collections of message sequence charts In: 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), 28 Aug - 01 Sep 2000, Bratislava, Slovakia.

Mukund, Madhavan ; Narayan Kumar, K. ; Sohoni, Milind (2000) Synthesizing distributed finite-state systems from MSCs In: 11th International Conference on Concurrency Theory (CONCUR - 2000), 22 25 Aug 2000, University Park, PA.

Mukund, Madhavan ; Narayan Kumar, K. ; Smolka, Scott A. (1999) Faster model checking for open systems In: 5th Asian Computing Science Conference, 10-12 Dec 1999, Phuket, Thailand.

Mukund, Madhavan ; Narayan Kumar, K. ; Radhakrishnan, Jaikumar ; Sohoni, Milind (1998) Robust asynchronous protocols are finite-state Lecture Notes in Computer Science, 1443 . pp. 188-199. ISSN 0302-9743

Mukund, Madhavan ; Narayan Kumar, K. ; Radhakrishnan, Jaikumar ; Sohoni, Milind (1998) Towards a characterisation of finite-state message-passing systems Lecture Notes in Computer Science, 1538 . pp. 282-299. ISSN 0302-9743

Mukund, Madhavan ; Narayan Kumar, K. ; Sohoni, Milind (1995) Keeping track of the latest gossip in message-passing systems In: Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT),, 11-13 May 1995, Berlin, Germany.