Counterexample computation in compositional nonblocking verification
This paper describes algorithms to compute a counterexample when compositional nonblocking verification determines that a discrete event system is blocking. Counterexamples are an important feature of model checking that explains the cause of a detected problem, greatly helping users to understand a...
Saved in:
Main Authors: | Malik, Robi, Ware, Simon |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89807 http://hdl.handle.net/10220/47151 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On decidability of existence of nonblocking supervisors resilient to smart sensor attacks
by: Su, Rong
Published: (2023) -
Formal approach to program verification
by: Chatchai Koetsawat
Published: (2006) -
Cell : A compositional verification framework
by: JI KUN
Published: (2013) -
Interpolation guided compositional verification
by: LIN, Shang-Wei, et al.
Published: (2015) -
Immutable specifications for more concise and precise verification
by: David, C., et al.
Published: (2013)