APAC:一个抽象概率自动机的推理工具

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI:10.1109/QEST.2011.28

Benoît Delahaye, K. Larsen, Axel Legay, Mikkel L. Pedersen, A. Wąsowski

{"title":"APAC:一个抽象概率自动机的推理工具","authors":"Benoît Delahaye, K. Larsen, Axel Legay, Mikkel L. Pedersen, A. Wąsowski","doi":"10.1109/QEST.2011.28","DOIUrl":null,"url":null,"abstract":"We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"APAC: A Tool for Reasoning about Abstract Probabilistic Automata\",\"authors\":\"Benoît Delahaye, K. Larsen, Axel Legay, Mikkel L. Pedersen, A. Wąsowski\",\"doi\":\"10.1109/QEST.2011.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.\",\"PeriodicalId\":252235,\"journal\":{\"name\":\"2011 Eighth International Conference on Quantitative Evaluation of SysTems\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Eighth International Conference on Quantitative Evaluation of SysTems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QEST.2011.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QEST.2011.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

摘要摘要概率自动机(Abstract Probabilistic Automata, APA)是一种新的、功能强大的概率自动机抽象形式。我们的理论配备了一系列用于状态空间约简的积极抽象技术，以及用于逻辑和结构比较的规范理论。本文报告了该方法在抽象概率自动机检查工具集中的实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

APAC: A Tool for Reasoning about Abstract Probabilistic Automata

We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 Eighth International Conference on Quantitative Evaluation of SysTems

自引率

0.00%

发文量