{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187373,0.0009531588,0.001368451,0.001345222,0.00164265,0.003043078,0.00215614,0.002532223,0.01353411],"category_scores_gemma":[0.0177407,0.0009684819,0.001349557,0.001103554,0.004052638,0.01286848,0.005369567,0.006713567,0.001664015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001590946,"about_ca_system_score_gemma":0.0008227446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008070981,"about_ca_topic_score_gemma":0.0007917699,"domain_scores_codex":[0.997887,0.0005264468,0.00006323771,0.0004121055,0.0008158846,0.0002953225],"domain_scores_gemma":[0.9899906,0.007232209,0.0003490698,0.001455723,0.0006391746,0.0003332565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004165753,0.00002527732,0.0001699356,0.0001019255,0.00001581194,0.0001174665,0.0001865222,0.004397276,0.001450739,0.9711159,0.004550004,0.01782742],"study_design_scores_gemma":[0.000007058627,0.00001142523,0.00005127199,0.00003217503,0.000006835632,0.00007970234,0.00004113695,0.01696936,0.0006945622,0.9744545,0.007646005,0.000006043018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05817938,0.003495001,0.7069354,0.01097649,0.000959668,0.0001142113,0.0003209198,0.000551782,0.2184671],"genre_scores_gemma":[0.8147424,0.004281124,0.112553,0.00170466,0.001843841,0.0003445304,0.0008749971,0.001050562,0.06260483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01353411,"threshold_uncertainty_score":0.04527605,"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."}}