Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Test generation for interaction detection in feature-rich communication systems

From MaRDI portal
Publication:856934
Jump to:navigation, search

DOI10.1016/J.COMNET.2006.08.015zbMath1119.68018OpenAlexW2031959737MaRDI QIDQ856934

Ruibing Hao, Caixia Chi

Publication date: 14 December 2006

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2006.08.015


zbMATH Keywords

dual graphfinite state machineEuler tourchinese postman tourfeature interaction testing


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)


Related Items (3)

Solving the time varying postman problems with timed automata ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time ⋮ The time-dependent rural postman problem: polyhedral results







This page was built for publication: Test generation for interaction detection in feature-rich communication systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:856934&oldid=12801027"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 14:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki