Verification of component-based systems with recursive architectures - IMAG Access content directly
Journal Articles Theoretical Computer Science Year : 2023

Verification of component-based systems with recursive architectures

Marius Bozga
Radu Iosif
  • Function : Author
Joseph Sifakis
  • Function : Author


We study a sound verification method for parametric component-based systems. The method uses a resource logic, a new formal specification language for distributed systems consisting of a finite yet unbounded number of components. The logic allows the description of architecture configurations coordinating instances of a finite number of types of components, by means of inductive definitions similar to the ones used to describe algebraic data types or recursive data structures. For parametric systems specified in this logic, we show that decision problems such as reaching deadlock or violating critical section are undecidable, in general. Despite this negative result, we provide for these decision problems practical semi-algorithms relying on the automatic synthesis of structural invariants allowing the proof of general safety properties. The invariants are defined using the WSκS fragment of the monadic second order logic, known to be decidable by a classical automata-logic connection, thus reducing a verification problem to checking satisfiability of a WSκS formula.
Fichier principal
Vignette du fichier
draft.pdf (671.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04106065 , version 1 (25-05-2023)



Marius Bozga, Radu Iosif, Joseph Sifakis. Verification of component-based systems with recursive architectures. Theoretical Computer Science, 2023, 940, Part B, pp.146-175. ⟨10.1016/j.tcs.2022.10.022⟩. ⟨hal-04106065⟩
12 View
1 Download



Gmail Facebook Twitter LinkedIn More