Searching for authors named "Madhavan Mukund" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

20 documents found, showing 1 through 10. Next 10 →

Hereditary history preserving bisimulation is decidable for trace-labelled systems
by Madhavan Mukund — 2002 — In: FSTTCS’02. Volume 2556 of LNCS. (2002) 289–300
…–300. Hereditary history preserving bisimulation is decidable for trace-labelled systems ⋆ Madhavan Mukund Chennai…
Cited by 4 (0 self) – Add To MetaCart

Linear-Time Temporal Logic and Büchi Automata
by Madhavan Mukund — 1997
…Linear-Time Temporal Logic and Buchi Automata Madhavan Mukund SPIC Mathematical Institute 92 G N…
Cited by 1 (0 self) – Add To MetaCart

Petri Nets And Step Transition Systems
by Madhavan Mukund — 1992 — International Journal of Foundations of Computer Science
… TRANSITION SYSTEMS MADHAVAN MUKUND School of Mathematics, SPIC Science Foundation 92, G. N. Chetty Road, T…
Cited by 41 (1 self) – Add To MetaCart

Keeping Track of the Latest Gossip in a Distributed System
by Madhavan Mukund, Milind Sohoni — 1997 — DISTRIBUTED COMPUTING
…Keeping Track of the Latest Gossip in a Distributed System Madhavan Mukund SPIC Mathematical…
Cited by 4 (1 self) – Add To MetaCart

Gossiping, Asynchronous Automata and Zielonka's Theorem
by Madhavan Mukund, Milind Sohoni — 1994 — SCHOOL OF MATHEMATICS, SPIC SCIENCE FOUNDATION
… Madhavan Mukund and Milind Sohoni School of Mathematics SPIC Science Foundation 92 G.N. Chetty Road, T…
Cited by 3 (2 self) – Add To MetaCart

Determinizing Asynchronous Automata
by Nils Klarlund, Madhavan Mukund, Milind Sohoni — 1993 — Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP'94), Jerusalem (Israel) 1994, number 820 in Lecture
…Determinizing Asynchronous Automata Nils Klarlund Madhavan Mukund y Milind Sohoni y Oktober…
Cited by 8 (2 self) – Add To MetaCart

Local LTL with past constants is expressively complete for Mazurkiewicz traces
by Paul Gastin, Madhavan Mukund, K. Narayan Kumar — 2003 — In Proc. of MFCS’03, number 2747 in LNCS
… LTL with past constants is expressively complete for Mazurkiewicz traces ⋆ Paul Gastin 1 , Madhavan…
Cited by 4 (2 self) – Add To MetaCart

Bounded time-stamping in message-passing systems
by Madhavan Mukund, K. Narayan Kumar, Milind Sohoni — 2003 — THEORETICAL COMPUTER SCIENCE
…Bounded time-stamping in message-passing systems ⋆ Madhavan Mukund Chennai Mathematical Institute…
Cited by 1 (0 self) – Add To MetaCart

Synthesizing Distributed Transition Systems From Global Specifications
by Ilaria Castellani, Madhavan Mukund, P S Thiagarajan — 1999
… , Madhavan Mukund 2 , and P S Thiagarajan 2 1 INRIA Sophia Antipolis, 2004 route des Lucioles, B.P. 93…
Cited by 9 (0 self) – Add To MetaCart

Determinizing Asynchronous Automata on Infinite Inputs
by Nils Klarlund, Nils Klarlund, Madhavan Mukund, Madhavan Mukund, Milind Sohoni, Milind Sohoni — 1995 — Appears in Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science: 15th Conference, FST&TCS '95 Proceedings, LNCS 1026
… Nils Klarlund Madhavan Mukund Milind Sohoni BRICS Report Series RS-95-58 ISSN 0909-0878 November 1995…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB