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...
Saved in:
Main Authors: | Wang, Ting, Chen, Tieming, Liu, Yang, Wang, Ye |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140644 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Verifying linearizability via optimized refinement checking
by: Liu, Y., et al.
Published: (2014) -
Verifying linearizability via optimized refinement checking
by: LIU, Yang, et al.
Published: (2013) -
More anti-chain based refinement checking
by: WANG, Ting, et al.
Published: (2012) -
PRTS: An approach for model checking probabilistic real-time hierarchical systems
by: SUN, Jun, et al.
Published: (2011) -
Probabilistic model checking multi-agent behaviors in dispersion games using counter abstraction
by: HAO, Jianye, et al.
Published: (2012)