{"id":"W2222821827","doi":"10.1007/978-3-662-49674-9_28","title":"Approaching the Coverability Problem Continuously","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Petri net; Computer science; Reachability; Reachability problem; Pruning; Theoretical computer science; Encoding (memory); Process architecture; Programming language; Algorithm; Artificial intelligence","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00443298,0.0004940764,0.0004613333,0.0003368016,0.0004679907,0.0006997656,0.00597713,0.000299384,0.000013657],"category_scores_gemma":[0.0003299993,0.0003022605,0.0001492813,0.0004680601,0.001303931,0.000991285,0.001742928,0.0009881123,0.00006505997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004292987,"about_ca_system_score_gemma":0.0005089082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001231502,"about_ca_topic_score_gemma":0.00001569712,"domain_scores_codex":[0.9957479,0.0001627953,0.0006435364,0.001622744,0.001114916,0.0007081467],"domain_scores_gemma":[0.9956023,0.000900777,0.0004656591,0.002632077,0.0002714106,0.0001277411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003739795,0.00001307826,0.00003485992,0.0000251302,0.000005750797,0.00000531323,0.0006144815,0.001756996,0.00008921016,0.2787714,0.000009647809,0.7186704],"study_design_scores_gemma":[0.0002460183,0.0001410773,0.0002314078,0.000364399,0.0000076735,0.00008542667,1.661783e-7,0.2753088,0.001399065,0.7153752,0.006124111,0.0007165633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003005405,0.0002045848,0.975376,0.001474072,0.001586508,0.0007872754,0.000004210796,0.0002087799,0.02032856],"genre_scores_gemma":[0.03071511,0.00002130323,0.966973,0.001164238,0.0004365205,0.00002999737,0.000001146236,0.00003039696,0.0006283004],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7179539,"threshold_uncertainty_score":0.999943,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02460811052143115,"score_gpt":0.2624790926917302,"score_spread":0.237870982170299,"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."}}