Show simple item record

dc.contributor.authorWang, T
dc.contributor.authorSun, J
dc.contributor.authorWang, X
dc.contributor.authorLiu, Y
dc.contributor.authorSi, Y
dc.contributor.authorDong, JS
dc.contributor.authorYang, X
dc.contributor.authorLi, X
dc.date.accessioned2017-10-23T04:53:50Z
dc.date.available2017-10-23T04:53:50Z
dc.date.issued2015
dc.identifier.issn0098-5589
dc.identifier.doi10.1109/TSE.2014.2359893
dc.identifier.urihttp://hdl.handle.net/10072/172877
dc.description.abstractZeno 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 counterexamples during model checking. Existing approaches on non-Zenoness checking include either introducing an additional clock in the Timed Automata models or additional accepting states in the zone graphs. In addition, there are approaches proposed for alternative timed modeling languages, which could be generalized to Timed Automata. In this work, we investigate the problem of non-Zenoness checking in the context of model checking LTL properties, not only evaluating and comparing existing approaches but also proposing a new method. To have a systematic evaluation, we develop a software toolkit to support multiple non-Zenoness checking algorithms. The experimental results show the effectiveness of our newly proposed algorithm, and demonstrate the strengths and weaknesses of different approaches.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers
dc.relation.ispartofpagefrom6908008-3
dc.relation.ispartofpageto6908008-18
dc.relation.ispartofissue1
dc.relation.ispartofjournalIEEE Transactions on Software Engineering
dc.relation.ispartofvolume41
dc.subject.fieldofresearchSoftware engineering not elsewhere classified
dc.subject.fieldofresearchInformation systems
dc.subject.fieldofresearchcode461299
dc.subject.fieldofresearchcode4609
dc.titleA systematic study on explicit-state non-zenoness checking for timed automata
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorDong, Jin-Song


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record