{"title":"RiskStructures: A design algebra for risk-aware machines","authors":"Mario Gleirscher, R. Calinescu, J. Woodcock","doi":"10.1007/s00165-021-00545-4","DOIUrl":"https://doi.org/10.1007/s00165-021-00545-4","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"33 1","pages":"763 - 802"},"PeriodicalIF":1.0,"publicationDate":"2021-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00545-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52394880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhancing Probabilistic Model Checking with Ontologies","authors":"Clemens Dubslaff, P. Koopmann, Anni-Yasmin Turhan","doi":"10.1007/s00165-021-00549-0","DOIUrl":"https://doi.org/10.1007/s00165-021-00549-0","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"33 1","pages":"885 - 921"},"PeriodicalIF":1.0,"publicationDate":"2021-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00549-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44186504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantics of the probabilistic Lambda Calculus By Dirk Draheim","authors":"M. Loreti","doi":"10.1007/s00165-021-00534-7","DOIUrl":"https://doi.org/10.1007/s00165-021-00534-7","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"33 1","pages":"457 - 458"},"PeriodicalIF":1.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00534-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52394770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhibin Yang, Yang Bao, Yongqiang Yang, Zhiqiu Huang, J. Bodeveix, M. Filali, Zonghua Gu
{"title":"Exploiting augmented intelligence in the modeling of safety-critical autonomous systems","authors":"Zhibin Yang, Yang Bao, Yongqiang Yang, Zhiqiu Huang, J. Bodeveix, M. Filali, Zonghua Gu","doi":"10.1007/s00165-021-00543-6","DOIUrl":"https://doi.org/10.1007/s00165-021-00543-6","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"33 1","pages":"343 - 384"},"PeriodicalIF":1.0,"publicationDate":"2021-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00543-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42350158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Derrick, Simon Doherty, Brijesh Dongol, G. Schellhorn, H. Wehrheim
{"title":"Verifying correctness of persistent concurrent data structures: a sound and complete method","authors":"J. Derrick, Simon Doherty, Brijesh Dongol, G. Schellhorn, H. Wehrheim","doi":"10.1007/s00165-021-00541-8","DOIUrl":"https://doi.org/10.1007/s00165-021-00541-8","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"33 1","pages":"547 - 573"},"PeriodicalIF":1.0,"publicationDate":"2021-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00541-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47336291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Milan Ceska, Christian Hensel, Sebastian Junges, J. Katoen
{"title":"Counterexample-guided inductive synthesis for probabilistic systems","authors":"Milan Ceska, Christian Hensel, Sebastian Junges, J. Katoen","doi":"10.1007/s00165-021-00547-2","DOIUrl":"https://doi.org/10.1007/s00165-021-00547-2","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"33 1","pages":"637 - 667"},"PeriodicalIF":1.0,"publicationDate":"2021-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00547-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46366848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Probabilistic Bigraphs","authors":"B. Archibald, M. Calder, Michele Sevegnani","doi":"10.1145/3545180","DOIUrl":"https://doi.org/10.1145/3545180","url":null,"abstract":"Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probabilistic bigraphs, and then again to action bigraphs, which include non-determinism and rewards. The extensions are implemented in the BigraphER toolkit and illustrated through examples of virus spread in computer networks and data harvesting in wireless sensor systems. BigraphER also supports the existing stochastic bigraphs extension of Krivine et al. and using BigraphER we give, for the first time, a direct implementation of the membrane budding model used to motivate stochastic bigraphs.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"34 1","pages":"1 - 27"},"PeriodicalIF":1.0,"publicationDate":"2021-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43400067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}