Deciding probabilistic automata weak bisimulation: theory and practice
文献类型：期刊论文
| 作者 | Fioriti, LMF ; Hashemi, V ; Hermanns, H ; Turrini, A |
| 刊名 | FORMAL ASPECTS OF COMPUTING
 |
| 出版日期 | 2016 |
| 卷号 | 28期号:1页码:109-143 |
| 关键词 | Complexity Compositional analysis Concurrency Efficiency Linear programming Probabilistic automata Satisfiability modulo theories Weak bisimulation |
| ISSN号 | 0934-5043 |
| 中文摘要 | Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions. It is hence of polynomial complexity. This paper discusses the specific complexity class of the weak probabilistic bisimulation problem, and it considers several practical algorithms and linear programming problem transformations that enable an efficient solution. We then discuss two different implementations of a probabilistic automata weak probabilistic bisimulation minimizer, one of them employing SAT modulo linear arithmetic as the solver technology. Empirical results demonstrate the effectiveness of the minimization approach on standard benchmarks, also highlighting the benefits of compositional minimization. |
| 英文摘要 | Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions. It is hence of polynomial complexity. This paper discusses the specific complexity class of the weak probabilistic bisimulation problem, and it considers several practical algorithms and linear programming problem transformations that enable an efficient solution. We then discuss two different implementations of a probabilistic automata weak probabilistic bisimulation minimizer, one of them employing SAT modulo linear arithmetic as the solver technology. Empirical results demonstrate the effectiveness of the minimization approach on standard benchmarks, also highlighting the benefits of compositional minimization. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000372262000006 |
| 公开日期 | 2016-12-09 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17348]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Fioriti, LMF,Hashemi, V,Hermanns, H,et al. Deciding probabilistic automata weak bisimulation: theory and practice[J]. FORMAL ASPECTS OF COMPUTING,2016,28(1):109-143. |
| APA | Fioriti, LMF,Hashemi, V,Hermanns, H,&Turrini, A.(2016).Deciding probabilistic automata weak bisimulation: theory and practice.FORMAL ASPECTS OF COMPUTING,28(1),109-143. |
| MLA | Fioriti, LMF,et al."Deciding probabilistic automata weak bisimulation: theory and practice".FORMAL ASPECTS OF COMPUTING 28.1(2016):109-143. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。