Anti-chain based algorithms for timed/probabilistic refinement checking
Refinement checking answers the question on whether an implementation model is a refinement of a specification model, which is of great value for system verification. Some refinement relationships, e.g., trace refinement and failures/divergence refinement, have been recognized for different verifica...
Main Authors: | Wang, Ting, Chen, Tieming, Liu, Yang, Wang, Ye |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140644 |
Similar Items
-
Towards model checking android applications
by: Bai, Guangdong, et al.
Published: (2020) -
Reading Courtesy Amounts on Handwritten Paper Checks
by: Palacios, Rafael, et al.
Published: (2002) -
Automatic Error Finding in Access-Control Policies
by: Jayaraman, Karthick, et al.
Published: (2010) -
From verified model to executable program: the PAT approach
by: Zhu, Huiquan, et al.
Published: (2017) -
World refining industry to 2015 : what does the future hold for the refining business /
by: 408393 Manning, Thomas J.
Published: (1995)