{"id":"W2048713255","doi":"10.1007/s00165-014-0325-8","title":"Synthesizing bounded-time 2-phase fault recovery","year":2014,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Liveness; Computer science; Bounded function; Theory of computation; Fault tolerance; Algorithm; Simple (philosophy); Sequence (biology); Ideal (ethics); Time complexity; Class (philosophy); Distributed computing; Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001766874,0.0002591638,0.0005080123,0.0002303177,0.0003042338,0.0003303354,0.001245813,0.0001005699,0.00001371686],"category_scores_gemma":[0.0003571965,0.0002525215,0.0001922118,0.0004402447,0.00005424816,0.001665806,0.0006109677,0.000219286,0.0002331692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007385118,"about_ca_system_score_gemma":0.00009883136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000552666,"about_ca_topic_score_gemma":0.000001993924,"domain_scores_codex":[0.9973605,0.0001651289,0.0007580929,0.0004768989,0.0005319547,0.0007074761],"domain_scores_gemma":[0.997763,0.0005907481,0.0005532971,0.0007695894,0.000166974,0.000156436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005301472,0.0003716498,0.0001965974,0.0004088313,0.0001842217,0.00005035753,0.002538929,0.02354966,0.03876322,0.4116099,0.0003197566,0.5219539],"study_design_scores_gemma":[0.0007536854,0.0003792532,0.0002767342,0.0003411639,0.00001154719,0.0001036576,0.00004613547,0.9631885,0.02631994,0.007611281,0.0005902009,0.0003778487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3094477,0.00004760323,0.6499107,0.0000885673,0.0004330731,0.0001552485,7.380821e-7,0.0003036524,0.0396127],"genre_scores_gemma":[0.8725232,9.032761e-7,0.1270121,0.00006852044,0.0003150973,0.000001599088,0.000001952028,0.00002117043,0.00005546067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9396389,"threshold_uncertainty_score":0.9999927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008436181392611425,"score_gpt":0.2414659828690756,"score_spread":0.2330298014764641,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}