# Checking Properties along Multiple Reconfiguration Paths for Component-Based Systems

## TL;DR

This paper presents a method for verifying properties along multiple reconfiguration paths in component-based systems using regular expressions and automata techniques, extending previous work to handle more complex reconfiguration sequences.

## Contribution

It introduces a generalized approach for checking architectural, event, and temporal properties along multiple reconfiguration paths using regular expressions and automata, handling more complex sequences.

## Key findings

- Method can verify properties along multiple reconfiguration paths
- Uses automata and marking techniques for property verification
- Extends previous work to handle more complex reconfiguration sequences

## Abstract

Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce multiple reconfiguration paths. We show how to put into action procedures allowing architectural, event, and temporal properties to be proved. Our method, related to finite state automata and using marking techniques, generalises what we did within previous work, where the regular expressions we processed were more restricted. But we can only deal with a subset of first-order logic formulas.