.png){kind=icon}
.png){kind=icon}
Return
Model Checking in Isomorphic Module Systems
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2018.2844683.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With a growing number of interacting modules in today's complex systems, finding an effective tool for detecting design errors has become increasingly challenging. We present procedures for analyzing blocking or deadlock in systems consisting of isomorphic modules instantiated from a template. These procedures identify all possible blocking or deadlock sources and directly compute the maximum number of isomorphic modules under which the system is guaranteed to be nonblocking or deadlock-free.
Keywords:
Automata
discrete event systems
formal methods
model checking
parameterized systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W