Show simple item record

dc.creator Germanos, Vasileios
dc.creator Haar, Stefan
dc.creator Khomenko, Victor
dc.creator Schwoon, Stefan
dc.date 2019-01-04T10:10:17Z
dc.date 2019-01-04T10:10:17Z
dc.date 2014-06
dc.date 2014-04-01
dc.date.accessioned 2023-02-22T17:06:31Z
dc.date.available 2023-02-22T17:06:31Z
dc.identifier Germanos, V., Haar, S., Khomenko, V. and Schwoon S. (2014) Diagnosability under weak fairness. 15th IEEE International Conference on Application of Concurrency to System Design, June 2014
dc.identifier 1550-4808
dc.identifier http://hdl.handle.net/2086/17395
dc.identifier.uri http://localhost:8080/xmlui/handle/CUHPOERS/254477
dc.description In partially observed Petri nets, diagnosis is the task of detecting whether or not the given sequence of observed labels indicates that some unobservable fault has occurred. Diagnosability is an associated property of the Petri net, stating that in any possible execution an occurrence of a fault can eventually be diagnosed. In this paper we consider diagnosability under the weak fairness (WF) assumption, which intuitively states that no transition from a given set can stay enabled forever -- it must eventually either fire or be disabled. We show that a previous approach to WF-diagnosability in the literature has a major flaw, and present a corrected notion. Moreover, we present an efficient method for verifying WF-diagnosability based on a reduction to LTL-X model checking. An important advantage of this method is that the LTL-X formula is fixed -- in particular, the WF assumption does not have to be expressed as a part of it (which would make the formula length proportional to the size of the specification), but rather the ability of existing model checkers to handle weak fairness directly is exploited.
dc.format application/pdf
dc.language en
dc.publisher IEEE
dc.subject Diagnosability
dc.subject weak fairness
dc.subject model checking
dc.subject LTL-X
dc.subject formal verification
dc.subject Petri nets
dc.title Diagnosability Under Weak Fairness
dc.type Conference


Files in this item

Files Size Format View
PID3194711.pdf 676.1Kb application/pdf View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse