CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A survey on efficient diagnosability tests for automata and bounded Petri nets

Mona Noori Hosseini (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation) ; Maria Paola Cabasino ; Carla Seatzu
2013 IEEE 18th International Conference on Emerging Technologies and Factory Automation, ETFA 2013, Cagliari, Italy, 10-13 September 2013 (1946-0740). p. 1-6. (2013)
[Konferensbidrag, refereegranskat]

This paper presents a survey and evaluation of the efficiency of polynomial diagnosability algorithms for systems modeled by Petri nets and automata. A modified verification algorithm that reduces the state space by exploiting symmetry and abstracting unobservable transitions is also proposed. We show the importance of minimal explanations on the performance of diagnosability verifiers. Different verifiers are compared in terms of state space and elapsed time. It is shown that the minimal explanation notion involved in the modified basis reachability graph, a graph presented by Cabasino et al. [3] for diagnosability analysis of Petri nets, has great impact also on automata-based diagnosability methods. The evaluation often shows improved computation times of a factor 1000 or more when the concept of minimal explanation is included in the computation.

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-01-17. Senast ändrad 2016-08-30.
CPL Pubid: 192789


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Automation



Chalmers infrastruktur