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

Verification of diagnosability based on compositional branching bisimulation

Mona Noori Hosseini (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation)
Göteborg : Chalmers University of Technology, 2014. - 9 s.
[Rapport]

This paper presents an efficient diagnosability verification technique, based on a general abstraction approach. We exploit branching bisimulation with explicit divergence (BBED), which preserves the temporal logic property that verifies diagnosability. Furthermore, using compositional abstraction for modular diagnosability verification offers additional state space reduction in comparison to the state-of-the-art techniques.



Denna post skapades 2014-07-09. Senast ändrad 2014-08-11.
CPL Pubid: 200322

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)