Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samir G. Kelekar

dblp:96/2413 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 100%
Theoretical computer science
1 paper
Automata and formal languages · 50% Logic in computer science · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Debugging and program repair
automated program repair
0.011994
Automated repair of complex systems by fault compensation · IEEE/ACM Trans. Netw. 1994
Distributed systems
fault management
0.011994
Automated repair of complex systems by fault compensation · IEEE/ACM Trans. Netw. 1994
Distributed systems
fault tolerance
0.011994
Automated repair of complex systems by fault compensation · IEEE/ACM Trans. Netw. 1994
Logic in computer science › process algebra
communicating processes
0.011994
Automated repair of complex systems by fault compensation · IEEE/ACM Trans. Netw. 1994
Automata and formal languages
finite-state models
0.011994
Automated repair of complex systems by fault compensation · IEEE/ACM Trans. Netw. 1994

Methods — techniques the papers use, named apart from their topics

formal methods · 0.0finite-state modeling · 0.0compensator module insertion · 0.0
YearPublicationVenuePosition
1994 Automated repair of complex systems by fault compensation
abstract
A formal method used to repair discrete-event systems consisting of communicating processes is described. Two mechanisms of repairing faulty systems are proposed: the first inserts a new "compensator module" into the communication channel between the faulty process and one or more of its neighbors; the second modifies a neighbor of the faulty process in a compensating manner. The two mechanisms fall under a class of methods in which faults are not fixed by replacement of a faulty unit with a fault-free one, but where changes to the non-faulty parts of the system repair the system. A finite-state model is used to describe processes, and the problem is solved for two models of communication: the symmetric (or the handshake) model and, an asymmetric model. The algorithm is described, and examples are presented, including an indication of how the approach may be applied as part of a sophisticated fault management system for communication networks.>
George W. Hart, Samir G. Kelekar
IEEE/ACM Trans. Netw.2