Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/14545
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Djouvas, Constantinos | - |
dc.contributor.author | Griffeth, Nancy D. | - |
dc.contributor.author | Lynch, Nancy A. | - |
dc.date.accessioned | 2019-07-15T10:35:09Z | - |
dc.date.available | 2019-07-15T10:35:09Z | - |
dc.date.issued | 2006-10-31 | - |
dc.identifier.citation | Electronic Notes in Theoretical Computer Science, Volume 164, Issue 4 SPEC. ISS., 31 October 2006, Pages 67-82 | en_US |
dc.identifier.issn | 15710661 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/14545 | - |
dc.description.abstract | A hard problem in network testing is verifying the correctness of a class of networks, as well as the actual networks under test. In practice, at most a few networks (sometimes only one) are actually tested. Thus an important question is how to select one or more networks that are sufficiently representative to apply the results to a class of networks. We present a model-based technique for selecting a representative network. The central theorem establishes that the representative network displays any faults present in any network of the class. This paper introduces the concept of "self-similarity," which is used to select the network, and presents the results of an experiment in testing one class of networks. © 2006. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Electronic Notes in Theoretical Computer Science | en_US |
dc.subject | I/O automata | en_US |
dc.subject | model-checking | en_US |
dc.subject | parameterized processes | en_US |
dc.subject | Testing | en_US |
dc.subject | verification | en_US |
dc.title | Testing Self-Similar Networks | en_US |
dc.type | Article | en_US |
dc.collaboration | City University of New York | en_US |
dc.collaboration | Massachusetts Institute of Technology | en_US |
dc.subject.category | Media and Communications | en_US |
dc.journals | Subscription Journal | en_US |
dc.country | United States | en_US |
dc.subject.field | Social Sciences | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.doi | 10.1016/j.entcs.2006.09.007 | en_US |
dc.identifier.scopus | 2-s2.0-33750050567 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/33750050567 | - |
cut.common.academicyear | 2019-2020 | en_US |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
crisitem.journal.journalissn | 1571-0661 | - |
crisitem.journal.publisher | Elsevier | - |
crisitem.author.dept | Department of Communication and Internet Studies | - |
crisitem.author.faculty | Faculty of Communication and Media Studies | - |
crisitem.author.orcid | 0000-0003-1215-7294 | - |
crisitem.author.parentorg | Faculty of Communication and Media Studies | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
Page view(s) 50
290
Last Week
1
1
Last month
1
1
checked on Nov 27, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.