中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Deciding probabilistic automata weak bisimulation: theory and practice
Author: Fioriti, LMF ; Hashemi, V ; Hermanns, H ; Turrini, A
Keyword: Complexity ; Compositional analysis ; Concurrency ; Efficiency ; Linear programming ; Probabilistic automata ; Satisfiability modulo theories ; Weak bisimulation
Source: FORMAL ASPECTS OF COMPUTING
Issued Date: 2016
Volume: 28, Issue:1, Pages:109-143
Indexed Type: SCI
Department: Univ Saarland, Dept Comp Sci, D-66123 Saarbrucken, Germany. Max Planck Inst Informat, D-66123 Saarbrucken, Germany. Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
Abstract: 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.
English Abstract: 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.
Language: 英语
WOS ID: WOS:000372262000006
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17348
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
art%3A10.1007%2Fs00165-016-0356-4.pdf(2164KB)----限制开放 联系获取全文

Recommended Citation:
Fioriti, LMF,Hashemi, V,Hermanns, H,et al. Deciding probabilistic automata weak bisimulation: theory and practice[J]. FORMAL ASPECTS OF COMPUTING,2016-01-01,28(1):109-143.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Fioriti, LMF]'s Articles
[Hashemi, V]'s Articles
[Hermanns, H]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Fioriti, LMF]‘s Articles
[Hashemi, V]‘s Articles
[Hermanns, H]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace