{"id":"W2121059177","doi":"10.1109/glsv.1994.289974","title":"An efficient algorithm for the realizability analysis of signal transition graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Realizability; Concurrency; Computer science; Transition system; SIGNAL (programming language); Algorithm; State space; Exponential function; Polynomial; Theoretical computer science; State (computer science); Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.001064631,0.00006039557,0.0001202331,0.0001367015,0.00009655146,0.00003143423,0.0004837168,0.00003268872,0.00006302234],"category_scores_gemma":[0.00001559493,0.0000402054,0.0001510367,0.001223424,0.00006594203,0.0001529579,0.00001248907,0.00003418563,0.000001005988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001633148,"about_ca_system_score_gemma":0.000004913682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007014796,"about_ca_topic_score_gemma":0.000005773486,"domain_scores_codex":[0.9991094,0.0001316042,0.0002218286,0.0002235298,0.0002004694,0.0001131547],"domain_scores_gemma":[0.998978,0.0001732547,0.00007224634,0.0006154692,0.0001276662,0.00003340262],"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.000005032113,0.0003461536,0.00004430651,0.000009153227,0.0001652593,1.169679e-7,0.002480055,0.08039168,0.000969293,0.1195169,0.00004583605,0.7960262],"study_design_scores_gemma":[0.000076916,0.00009579973,0.003383818,8.20492e-7,0.0001132971,3.95566e-7,0.0000474256,0.9911226,0.004129883,0.0009417388,0.00003518588,0.00005208894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006297265,0.00002708121,0.9929866,0.0001337877,0.00006265914,0.0002214205,0.0000119744,0.00005560128,0.0002036056],"genre_scores_gemma":[0.4245977,0.000003390839,0.5753131,0.00005052924,0.000005900317,0.00001974257,0.000003020004,0.000001563299,0.000005111893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.910731,"threshold_uncertainty_score":0.1639529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03737201445620189,"score_gpt":0.3028507440850043,"score_spread":0.2654787296288025,"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."}}