A systematic study on explicit-state non-zenoness checking for timed automata
Zeno runs, where infinitely many actions occur within finite time, may arise in Timed Automata models. Zeno runs are not feasible in reality and must be pruned during system verification. Thus it is necessary to check whether a run is Zeno or not so as to avoid presenting Zeno runs as counterexample...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2015
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4973 https://ink.library.smu.edu.sg/context/sis_research/article/5976/viewcontent/tse2015.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|