Petru Cașcaval

Dr. Petru Cașcaval

orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2001 in Microprocessors and Microsystems
Verified
Journal Article
Closed access
PCPetru Cașcaval
Petru Cașcaval
SBS. Bennett
S. Bennett

19 September 2019 in Microelectronics Journal
Verified
Journal Article
Closed access
PCPetru Cașcaval
Petru Cașcaval
DCD. Caşcaval
D. Caşcaval

1 July 2017
Verified
Conference Paper
Closed access
PCPetru Cașcaval
Petru Cașcaval
SFSabina-Adriana Floria
Sabina-Adriana Floria
This paper addresses the issue of the two-terminal reliability evaluation of medium-to-large networks and proposes a new method to solve the problem of `sum of disjoint products' (SDP) algebraically. This method uses a `multiple variables inversion' (MVI) technique for transforming a structure function into a sum of disjoint products which has a one-to-one correspondence with the reliability expression. The results of our method for several network models are compared with those obtained by means of other well-known MVI techniques. For large-scale networks, our method offers a better solution.

16 March 2012 in Elektronika ir Elektrotechnika
Verified
Journal Article
Closed access
PDF file
CHC. Huzum
C. Huzum
PCPetru Cașcaval
Petru Cașcaval
March Test for Static Neighborhood Pattern-Sensitive Faults in Random-Access Memories

1 June 2004 in Journal of Electronic Testing
Verified
Journal Article
Closed access
PDF file
PCPetru Cașcaval
Petru Cașcaval
SBStuart Bennett
Stuart Bennett
CHCorneliu Huţanu
Corneliu Huţanu

1 January 2018 in Complexity
Verified
Journal Article
Open access
PDF file
PCPetru Cașcaval
Petru Cașcaval
This paper deals with the issue of reliability evaluation in complex networks, in which both link and node failures are considered, and proposes an approximate method based on the minimal paths between two specified nodes. The method requires an algorithm for transforming the set of minimal paths into a sum of disjoint products (SDP). To reduce the computation burden, in the first stage, only the links of the network are considered. Then, in the second stage, each term of the set of disjoint link‐products is separately processed, taking into consideration the reliability values for both links and adjacent nodes. In this way, a reliability expression with a one‐to‐one correspondence to the set of disjoint products is obtained. This approximate method provides a very good accuracy and greatly reduces the computation for complex networks.