Остановите войну!
for scientists:
default search action
K. Narayan Kumar
- > Home > Persons > K. Narayan Kumar
Publications
- 2015
- [j8]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594: 24-43 (2015) - 2014
- [j7]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) - 2010
- [c27]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Model checking time-constrained scenario-based specifications. FSTTCS 2010: 204-215 - 2008
- [c24]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - 2007
- [c23]Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan, Shaofa Yang:
Anchored Concatenation of MSCs. Formal Models, Languages and Applications 2007: 274-288 - [c22]S. Akshay, Madhavan Mukund, K. Narayan Kumar:
Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR 2007: 181-196 - [c21]Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult. FCT 2007: 76-87 - 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) - [c20]Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan:
Causal Closure for MSC Languages. FSTTCS 2005: 335-347 - 2003
- [j3]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1): 221-239 (2003) - [c19]Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan:
Netcharts: Bridging the gap between HMSCs and executable specifications. CONCUR 2003: 293-307 - [c18]Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. MFCS 2003: 429-438 - 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 - 1999
- [c11]Madhavan Mukund, K. Narayan Kumar, Scott A. Smolka:
Faster Model Checking for Open Systems. ASIAN 1999: 227-238 - 1998
- [c7]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Towards a Characterisation of Finite-State Message-Passing Systems. ASIAN 1998: 282-299 - [c5]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Robust Asynchronous Protocols Are Finite-State. ICALP 1998: 188-199 - 1995
- [c3]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Keeping Track of the Latest Gossip in Message-Passing Systems. STRICT 1995: 249-263
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-25 02:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint