1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/39648
DC FieldValue
dc.titleNetcharts: Bridging the gap between HMSCs and executable specifications
dc.contributor.authorMukund, M.
dc.contributor.authorKumar, K.N.
dc.contributor.authorThiagarajan, P.S.
dc.date.accessioned2013-07-04T07:46:23Z
dc.date.available2013-07-04T07:46:23Z
dc.date.issued2003
dc.identifier.citationMukund, M.,Kumar, K.N.,Thiagarajan, P.S. (2003). Netcharts: Bridging the gap between HMSCs and executable specifications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2761 : 296-310. ScholarBank@NUS Repository.
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39648
dc.description.abstractWe define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivial. (ii) Netcharts can describe all regular MSC languages (sets of MSCs in which channel capacities have a finite upper bound), unlike HMSCs, which can only describe finitely-generated regular MSC languages. © Springer-Verlag Berlin Heidelberg 2003.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume2761
dc.description.page296-310
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.