A Modified Universal Generating Function Algorithm For The Acyclic Binary-State Network Reliability

Yeh, W

A Modified Universal Generating Function Algorithm For The Acyclic Binary-State Network Reliability

Yeh, W

Permalink

Publisher:: IEEE-inst Electrical Electronics Engineers Inc
Publication Type:: Journal Article
Citation:: IEEE Transactions On Reliability, 2012, 61 (3), pp. 702 - 709
Issue Date:: 2012-01

Closed Access

	Filename	Description	Size
	2012001363OK.pdf		1.54 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yeh, W	en_US
dc.date.issued	2012-01	en_US
dc.identifier.citation	IEEE Transactions On Reliability, 2012, 61 (3), pp. 702 - 709	en_US
dc.identifier.issn	0018-9529	en_US
dc.identifier.uri	http://hdl.handle.net/10453/23022
dc.description.abstract	Network reliability is an important part of planning, designing, and controlling networks. Now, the most general binary-state network (BSN) reliability evaluation methods are based on Minimal Paths (MPs), or Minimal Cuts (MCs). The universal generating f	en_US
dc.publisher	IEEE-inst Electrical Electronics Engineers Inc	en_US
dc.relation.ispartof	IEEE Transactions On Reliability	en_US
dc.relation.isbasedon	10.1109/TR.2012.2207574	en_US
dc.rights	© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.subject.classification	Operations Research	en_US
dc.title	A Modified Universal Generating Function Algorithm For The Acyclic Binary-State Network Reliability	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	61	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	0803 Computer Software	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.consider-herdc	true	en_US
pubs.issue	3	en_US
pubs.volume	61	en_US

Abstract:

Network reliability is an important part of planning, designing, and controlling networks. Now, the most general binary-state network (BSN) reliability evaluation methods are based on Minimal Paths (MPs), or Minimal Cuts (MCs). The universal generating f

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/23022