{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313497,0.001919725,0.001149085,0.002488706,0.001376165,0.001998816,0.002660286,0.001401909,0.01535698],"category_scores_gemma":[0.005394375,0.001161422,0.002080889,0.001733461,0.001289029,0.003256834,0.002296641,0.002136495,0.004433733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001536952,"about_ca_system_score_gemma":0.002707505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002272381,"about_ca_topic_score_gemma":0.00342119,"domain_scores_codex":[0.998436,0.0003039778,0.000151889,0.0004278479,0.0005060437,0.0001741695],"domain_scores_gemma":[0.9970948,0.001884619,0.0001590957,0.0004539732,0.0003480872,0.0000595707],"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.000417143,0.0003497052,0.001106278,0.001089219,0.0001588325,0.0004545914,0.0003664457,0.07032262,0.03903524,0.1619609,0.01522308,0.7095159],"study_design_scores_gemma":[0.0003399284,0.0002206294,0.0005256724,0.000168214,0.0001342432,0.0007191853,0.0001391622,0.6468911,0.03098833,0.2813177,0.03845001,0.0001058673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001012148,0.00005481632,0.9951271,0.00005078715,0.00001333906,0.00009924324,0.00009837688,0.002531565,0.00101265],"genre_scores_gemma":[0.02887289,0.000116821,0.9680599,0.00004747681,0.00002006399,0.000312009,0.0008020206,0.0005121141,0.001256701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01535698,"threshold_uncertainty_score":0.05137426,"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."}}