{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002947628,0.001109426,0.001692104,0.001176677,0.001845886,0.003151423,0.003263155,0.002892018,0.008746844],"category_scores_gemma":[0.01321993,0.001342662,0.002420862,0.002022278,0.003550505,0.01237366,0.004199906,0.006810318,0.0008713902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002638404,"about_ca_system_score_gemma":0.00141694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002994988,"about_ca_topic_score_gemma":0.002515417,"domain_scores_codex":[0.9968308,0.001186822,0.0001723263,0.0006164185,0.0008456688,0.0003480127],"domain_scores_gemma":[0.9842939,0.01371673,0.0004188559,0.0009062525,0.0004658868,0.0001983186],"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.00005386185,0.0000470924,0.0001807964,0.0001886506,0.00002213914,0.0001723817,0.0003214502,0.03420335,0.0008138953,0.9374112,0.003656908,0.02292834],"study_design_scores_gemma":[0.000009487448,0.00001160261,0.00007199627,0.00003817161,0.00001263662,0.00007538312,0.00005698264,0.07042409,0.0006523467,0.9248739,0.003761663,0.00001174326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03173239,0.002664022,0.9000188,0.003040785,0.0003187566,0.00008647284,0.0002234401,0.0004509567,0.0614643],"genre_scores_gemma":[0.6593364,0.003638224,0.2921251,0.001323458,0.001152363,0.0004643443,0.001563528,0.0007346816,0.039662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008746844,"threshold_uncertainty_score":0.02926105,"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."}}