{"id":"W4387844104","doi":"10.1007/978-3-031-45329-8_4","title":"On the Containment Problem for Deterministic Multicounter Machine Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Decidability; Computer science; Bounded function; Finite-state machine; Reachability; Petri net; Reachability problem; Turing machine; Deterministic algorithm; Containment (computer programming); Theoretical computer science; Algorithm; Computation; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002101016,0.0006466369,0.0006001974,0.0006287374,0.0004480808,0.0007660877,0.00493932,0.0002701004,0.000005383168],"category_scores_gemma":[0.0001772341,0.0004496734,0.0002046897,0.0004369711,0.0004117125,0.0003573394,0.001448869,0.0007024466,0.00006356306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005201284,"about_ca_system_score_gemma":0.0003872908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001540863,"about_ca_topic_score_gemma":0.00004959908,"domain_scores_codex":[0.9951982,0.00005284131,0.0007496092,0.001787196,0.001350984,0.0008611265],"domain_scores_gemma":[0.9939951,0.003233888,0.000369313,0.001997054,0.0002651553,0.0001395212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001624015,0.00002793758,0.000001580523,0.00008395007,0.00002303279,0.0000557669,0.001109636,0.5375957,0.00003137014,0.3033331,0.00007086925,0.1576508],"study_design_scores_gemma":[0.0002105689,0.0001549395,8.489355e-7,0.0004617094,0.000005954103,0.00001936369,1.556982e-7,0.6363477,0.00006804291,0.3621885,0.0002082237,0.0003339652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0000236593,0.0001214215,0.9924569,0.001409224,0.002074213,0.001640199,0.00003027668,0.0002579622,0.001986126],"genre_scores_gemma":[0.5316175,0.00003231855,0.4596961,0.005642851,0.000623223,0.0003486815,0.00001076411,0.0001575096,0.001870989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5327607,"threshold_uncertainty_score":0.9997955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04122514988229355,"score_gpt":0.2657951851318117,"score_spread":0.2245700352495181,"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."}}