.png){kind=icon}
返回
Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2013.2248255.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a method for compositional verification of the standard and generalized nonblocking properties of large discrete event systems. The method is efficient as it avoids the explicit construction of the complete state space by considering and simplifying individual subsystems before they are composed further. Simplification is done using a set of abstraction rules preserving generalized nonblocking equivalence, which are shown to be correct and computationally feasible. Experimental results demonstrate the suitability of the method to verify several large-scale discrete event systems models both for standard and generalized nonblocking.
Keyword:
Automata
discrete event systems
nonblocking
model/controller reduction
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏分享收藏Biodiesel Production From the Microalgae Nannochloropsis by Microwave Using CaO and MgO Catalysts
OAAI
OAAI分享收藏分享收藏Reductive cleavage of glycosides with borane complexes in the presence of boron trifluoride etherate
PREAI
分享收藏Nonconflict check by using sequential automaton abstractions based on weak observation equivalence.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容