{"id":"W2616942550","doi":"10.1109/syscon.2017.7934785","title":"Formalization of Birth-Death and IID processes in higher-order logic","year":2017,"lang":"en","type":"article","venue":"2017 Annual IEEE International Systems Conference (SysCon)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematical proof; Theoretical computer science; Process calculus; Markov process; State space; Markov chain; Scalability; Model checking; Formal methods; Probabilistic logic; Algorithm; Mathematics; Programming language; Artificial intelligence; Machine learning","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.00336135,0.0008829596,0.0005389205,0.001397218,0.0007457784,0.002207954,0.001526264,0.001046439,0.003086728],"category_scores_gemma":[0.005877201,0.0004066698,0.002072305,0.001068184,0.003231169,0.00268248,0.001420546,0.003026053,0.0004863205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002133607,"about_ca_system_score_gemma":0.002587071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003950102,"about_ca_topic_score_gemma":0.002455598,"domain_scores_codex":[0.9972206,0.000720175,0.0002679907,0.0004218542,0.001047129,0.000322263],"domain_scores_gemma":[0.995335,0.002827462,0.000615798,0.00047331,0.0005571236,0.0001913544],"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.00002030316,0.00004416128,0.0003854416,0.00007526021,0.00001478672,0.0002056545,0.0002251857,0.03994995,0.002005506,0.9478645,0.0003571249,0.008852107],"study_design_scores_gemma":[0.00005202677,0.00006991414,0.0002340168,0.00007380645,0.00004234017,0.0002469498,0.00006182559,0.3394819,0.004873229,0.6390744,0.01575579,0.00003379989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006039847,0.0002255013,0.9887549,0.0002617548,0.00005036477,0.00008008676,0.0001324878,0.0002830873,0.004172057],"genre_scores_gemma":[0.4680227,0.001048624,0.5235662,0.0004448722,0.0001956783,0.0005767738,0.0005365299,0.0001633356,0.005445446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003950102,"threshold_uncertainty_score":0.01777673,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1256810603399984,"score_gpt":0.3575524301032098,"score_spread":0.2318713697632113,"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."}}