Diagnosability Verification Using Compositional Branching Bisimulation
Paper i proceeding, 2016

This paper presents an efficient diagnosability verification technique, based on a general abstraction approach. More specifically, branching bisimulation including state labels with explicit divergence (BBSD) is defined. This bisimulation preserves the temporal logic property that verifies diagnosability. Based on a proposed BBSD algorithm, compositional abstraction for modular diagnosability verification is shown to offer a significant state space reduction in comparison to state-of-the-art techniques. This is illustrated by verifying nondiagnosability analytically for a set of synchronized components, where the abstracted solution is independent of the number of components and the number of observable events.

Författare

Mona Noori-Hosseini

Chalmers, Signaler och system, System- och reglerteknik, Automation

Bengt Lennartson

Chalmers, Signaler och system, System- och reglerteknik, Automation

13th International Workshop on Discrete Event Systems, Xi'an, China, May 30 - June 1

1550-5227 (ISSN)

245-250

Styrkeområden

Informations- och kommunikationsteknik

Produktion

Drivkrafter

Hållbar utveckling

Ämneskategorier

Robotteknik och automation

DOI

10.1109/WODES.2016.7497855

ISBN

978-1-5090-4190-9

Mer information

Skapat

2017-10-07