Symbolic synthesis of masking fault-tolerant distributed programs
Bonakdarpour B, Kulkarni S, Abujarad F. Symbolic synthesis of masking fault-tolerant distributed programs. Distributed Computing 2011, 25: 83-108. DOI: 10.1007/s00446-011-0139-3.Peer-Reviewed Original ResearchHigh worst-case complexityFault-intolerant versionState explosion problemProgram state spaceWorst-case complexityPresence of faultsProgram synthesisTime complexitySymbolic synthesisExplosion problemState spaceLiveness specificationsSynthesis heuristicsTypes of faultsReasonable amountDecision procedureSynthesis problemComplexityHeuristicsAlgorithmChallenging barriersBottleneckFaultsVerificationSpecificationAutomated constraint-based addition of nonmasking and stabilizing fault-tolerance
Abujarad F, Kulkarni S. Automated constraint-based addition of nonmasking and stabilizing fault-tolerance. Theoretical Computer Science 2011, 412: 4228-4246. DOI: 10.1016/j.tcs.2011.02.008.Peer-Reviewed Original ResearchData dissemination problemHeuristic-based approachRecovery actionsSensor networksInterference freedomDissemination problemTime complexityDistributed natureManual designTerms of constraintsHierarchical programMultiple constraintsSynthesis algorithmFairness assumptionsMutual exclusionTree maintenanceAlgorithmCase studyDifferent constraintsHierarchical systemExperimental resultsConstraintsComplexityRecovery pathLegitimate state